/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:59:26,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:59:26,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:59:26,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:59:26,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:59:26,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:59:26,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:59:26,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:59:26,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:59:26,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:59:26,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:59:26,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:59:26,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:59:26,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:59:26,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:59:26,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:59:26,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:59:26,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:59:26,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:59:26,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:59:26,871 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:59:26,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:59:26,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:59:26,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:59:26,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:59:26,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:59:26,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:59:26,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:59:26,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:59:26,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:59:26,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:59:26,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:59:26,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:59:26,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:59:26,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:59:26,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:59:26,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:59:26,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:59:26,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:59:26,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:59:26,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:59:26,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:59:26,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:59:26,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:59:26,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:59:26,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:59:26,903 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:59:26,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:59:26,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:59:26,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:59:26,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:59:26,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:59:26,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:59:26,904 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:59:26,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:59:26,905 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:59:26,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:59:26,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:59:26,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:59:26,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:59:26,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:59:26,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:59:26,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:59:26,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:59:26,906 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:59:26,906 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:59:26,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:59:26,906 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:59:26,906 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-15 05:59:27,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:59:27,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:59:27,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:59:27,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:59:27,166 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:59:27,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2022-04-15 05:59:27,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5614add9d/945375a0da1e4e50b7ac624000548a1a/FLAG0fdc8af43 [2022-04-15 05:59:27,524 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:59:27,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2022-04-15 05:59:27,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5614add9d/945375a0da1e4e50b7ac624000548a1a/FLAG0fdc8af43 [2022-04-15 05:59:27,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5614add9d/945375a0da1e4e50b7ac624000548a1a [2022-04-15 05:59:27,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:59:27,958 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:59:27,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:59:27,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:59:27,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:59:27,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:59:27" (1/1) ... [2022-04-15 05:59:27,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d51917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:27, skipping insertion in model container [2022-04-15 05:59:27,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:59:27" (1/1) ... [2022-04-15 05:59:27,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:59:27,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:59:28,133 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/simple_1-1.c[322,335] [2022-04-15 05:59:28,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:59:28,164 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:59:28,178 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/simple_1-1.c[322,335] [2022-04-15 05:59:28,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:59:28,204 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:59:28,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:28 WrapperNode [2022-04-15 05:59:28,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:59:28,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:59:28,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:59:28,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:59:28,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:28" (1/1) ... [2022-04-15 05:59:28,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:28" (1/1) ... [2022-04-15 05:59:28,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:28" (1/1) ... [2022-04-15 05:59:28,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:28" (1/1) ... [2022-04-15 05:59:28,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:28" (1/1) ... [2022-04-15 05:59:28,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:28" (1/1) ... [2022-04-15 05:59:28,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:28" (1/1) ... [2022-04-15 05:59:28,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:59:28,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:59:28,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:59:28,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:59:28,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:28" (1/1) ... [2022-04-15 05:59:28,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:59:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:28,281 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-15 05:59:28,303 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-15 05:59:28,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:59:28,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:59:28,330 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:59:28,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:59:28,330 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:59:28,330 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:59:28,331 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:59:28,331 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:59:28,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:59:28,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:59:28,332 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:59:28,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:59:28,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:59:28,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:59:28,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:59:28,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:59:28,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:59:28,382 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:59:28,384 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:59:28,486 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:59:28,492 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:59:28,493 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:59:28,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:59:28 BoogieIcfgContainer [2022-04-15 05:59:28,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:59:28,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:59:28,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:59:28,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:59:28,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:59:27" (1/3) ... [2022-04-15 05:59:28,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52adac53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:59:28, skipping insertion in model container [2022-04-15 05:59:28,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:59:28" (2/3) ... [2022-04-15 05:59:28,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52adac53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:59:28, skipping insertion in model container [2022-04-15 05:59:28,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:59:28" (3/3) ... [2022-04-15 05:59:28,519 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_1-1.c [2022-04-15 05:59:28,523 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:59:28,523 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:59:28,580 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:59:28,586 INFO L340 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 [2022-04-15 05:59:28,586 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:59:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:59:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 05:59:28,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:28,624 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:28,624 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-15 05:59:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:28,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649597613] [2022-04-15 05:59:28,653 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:59:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-15 05:59:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:28,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311764611] [2022-04-15 05:59:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:28,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:28,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 05:59:28,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 05:59:28,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 05:59:28,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:28,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 05:59:28,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 05:59:28,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 05:59:28,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2022-04-15 05:59:28,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0; {21#true} is VALID [2022-04-15 05:59:28,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-15 05:59:28,878 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {22#false} is VALID [2022-04-15 05:59:28,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-15 05:59:28,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-15 05:59:28,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 05:59:28,880 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-15 05:59:28,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:28,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311764611] [2022-04-15 05:59:28,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311764611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:28,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:28,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:59:28,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:28,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649597613] [2022-04-15 05:59:28,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649597613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:28,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:28,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:59:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892207545] [2022-04-15 05:59:28,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:28,893 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-15 05:59:28,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:28,897 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-15 05:59:28,921 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-15 05:59:28,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:59:28,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:59:28,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:59:28,954 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:29,043 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 05:59:29,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:59:29,044 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-15 05:59:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:29,045 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-15 05:59:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 05:59:29,058 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-15 05:59:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 05:59:29,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-15 05:59:29,108 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-15 05:59:29,115 INFO L225 Difference]: With dead ends: 29 [2022-04-15 05:59:29,115 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 05:59:29,117 INFO L912 BasicCegarLoop]: 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-15 05:59:29,120 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:29,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:59:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 05:59:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 05:59:29,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:29,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:29,152 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:29,152 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:29,154 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 05:59:29,155 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 05:59:29,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:29,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:29,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 05:59:29,156 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 05:59:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:29,161 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 05:59:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 05:59:29,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:29,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:29,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:29,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 05:59:29,170 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-15 05:59:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:29,170 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 05:59:29,171 INFO L479 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-15 05:59:29,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-15 05:59:29,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 05:59:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 05:59:29,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:29,208 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:29,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:59:29,209 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:29,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-15 05:59:29,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:29,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [64937226] [2022-04-15 05:59:29,210 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:59:29,211 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-15 05:59:29,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:29,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676080736] [2022-04-15 05:59:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:29,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:29,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:29,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 05:59:29,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 05:59:29,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 05:59:29,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:29,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 05:59:29,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 05:59:29,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 05:59:29,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret4 := main(); {135#true} is VALID [2022-04-15 05:59:29,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 0; {140#(= main_~x~0 0)} is VALID [2022-04-15 05:59:29,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {136#false} is VALID [2022-04-15 05:59:29,336 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {136#false} is VALID [2022-04-15 05:59:29,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-15 05:59:29,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-15 05:59:29,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-15 05:59:29,337 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-15 05:59:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:29,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676080736] [2022-04-15 05:59:29,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676080736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:29,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:29,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:59:29,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:29,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [64937226] [2022-04-15 05:59:29,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [64937226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:29,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:29,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:59:29,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985705844] [2022-04-15 05:59:29,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:29,340 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-15 05:59:29,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:29,340 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-15 05:59:29,358 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-15 05:59:29,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:59:29,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:29,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:59:29,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:59:29,360 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:29,417 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 05:59:29,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:59:29,418 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-15 05:59:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:29,418 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-15 05:59:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 05:59:29,419 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-15 05:59:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 05:59:29,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-15 05:59:29,460 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-15 05:59:29,461 INFO L225 Difference]: With dead ends: 18 [2022-04-15 05:59:29,461 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 05:59:29,461 INFO L912 BasicCegarLoop]: 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-15 05:59:29,462 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:29,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:59:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 05:59:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 05:59:29,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:29,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:29,467 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:29,467 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:29,468 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 05:59:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 05:59:29,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:29,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:29,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 05:59:29,469 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 05:59:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:29,470 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 05:59:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 05:59:29,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:29,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:29,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:29,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 05:59:29,472 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 05:59:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:29,472 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 05:59:29,472 INFO L479 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-15 05:59:29,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 05:59:29,484 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-15 05:59:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 05:59:29,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 05:59:29,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:29,485 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:29,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:59:29,486 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:29,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-15 05:59:29,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:29,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1733520159] [2022-04-15 05:59:30,260 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:30,263 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1867307785, now seen corresponding path program 1 times [2022-04-15 05:59:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:30,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990156232] [2022-04-15 05:59:30,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:30,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:30,316 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_1.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_1.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 05:59:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:30,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788958968] [2022-04-15 05:59:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:30,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:30,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:30,372 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-15 05:59:30,409 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-15 05:59:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:30,449 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:30,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:30,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-15 05:59:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:30,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6088976] [2022-04-15 05:59:30,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:30,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:30,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 05:59:30,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 05:59:30,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 05:59:30,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:30,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 05:59:30,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 05:59:30,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 05:59:30,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 05:59:30,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0; {239#(= main_~x~0 0)} is VALID [2022-04-15 05:59:30,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {240#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:30,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {235#false} is VALID [2022-04-15 05:59:30,614 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-15 05:59:30,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 05:59:30,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 05:59:30,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 05:59:30,615 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-15 05:59:30,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:30,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6088976] [2022-04-15 05:59:30,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6088976] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:30,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365925175] [2022-04-15 05:59:30,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:59:30,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:30,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:30,619 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-15 05:59:30,623 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-15 05:59:30,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:59:30,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:30,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:59:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:30,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:30,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-15 05:59:30,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 05:59:30,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 05:59:30,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 05:59:30,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 05:59:30,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0; {239#(= main_~x~0 0)} is VALID [2022-04-15 05:59:30,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {263#(= (+ (- 2) main_~x~0) 0)} is VALID [2022-04-15 05:59:30,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(= (+ (- 2) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 268435455); {235#false} is VALID [2022-04-15 05:59:30,773 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-15 05:59:30,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 05:59:30,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 05:59:30,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 05:59:30,774 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-15 05:59:30,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:30,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 05:59:30,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 05:59:30,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 05:59:30,837 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-15 05:59:30,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {235#false} is VALID [2022-04-15 05:59:30,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {291#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 05:59:30,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0; {295#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 05:59:30,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 05:59:30,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 05:59:30,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 05:59:30,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 05:59:30,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-15 05:59:30,840 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-15 05:59:30,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365925175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:30,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:30,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 05:59:30,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:30,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1733520159] [2022-04-15 05:59:30,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1733520159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:30,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:30,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:59:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207072794] [2022-04-15 05:59:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:30,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 05:59:30,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:30,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:30,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:30,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:59:30,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:59:30,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:59:30,855 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:30,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:30,912 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 05:59:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:59:30,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 05:59:30,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 05:59:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 05:59:30,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-15 05:59:30,933 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-15 05:59:30,934 INFO L225 Difference]: With dead ends: 19 [2022-04-15 05:59:30,934 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 05:59:30,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:59:30,935 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:30,936 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:59:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 05:59:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 05:59:30,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:30,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:30,941 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:30,941 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:30,942 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 05:59:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 05:59:30,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:30,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:30,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 05:59:30,943 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 05:59:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:30,944 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 05:59:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 05:59:30,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:30,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:30,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:30,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 05:59:30,946 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 05:59:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:30,946 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 05:59:30,946 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:30,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 05:59:30,960 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-15 05:59:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 05:59:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 05:59:30,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:30,961 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:30,987 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-15 05:59:31,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 05:59:31,384 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:31,385 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-15 05:59:31,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:31,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929228383] [2022-04-15 05:59:31,675 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:31,678 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1808202441, now seen corresponding path program 1 times [2022-04-15 05:59:31,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:31,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311443118] [2022-04-15 05:59:31,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:31,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:31,691 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_2.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_2.0)) 4294967296)) 268435455) 0)) [2022-04-15 05:59:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:31,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486840832] [2022-04-15 05:59:31,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:31,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:31,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:31,716 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-15 05:59:31,750 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-15 05:59:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:31,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:31,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:31,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-15 05:59:31,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:31,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668725077] [2022-04-15 05:59:31,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:31,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:31,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:31,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-15 05:59:31,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-15 05:59:31,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-15 05:59:31,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:31,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-15 05:59:31,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-15 05:59:31,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-15 05:59:31,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret4 := main(); {414#true} is VALID [2022-04-15 05:59:31,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0; {419#(= main_~x~0 0)} is VALID [2022-04-15 05:59:31,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:31,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {421#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:59:31,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {421#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {415#false} is VALID [2022-04-15 05:59:31,913 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-15 05:59:31,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-15 05:59:31,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-15 05:59:31,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-15 05:59:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:31,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:31,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668725077] [2022-04-15 05:59:31,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668725077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:31,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881483916] [2022-04-15 05:59:31,914 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:59:31,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:31,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:31,916 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-15 05:59:31,917 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-15 05:59:31,949 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:59:31,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:31,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:59:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:31,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:32,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-15 05:59:32,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-15 05:59:32,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-15 05:59:32,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-15 05:59:32,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret4 := main(); {414#true} is VALID [2022-04-15 05:59:32,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0; {419#(= main_~x~0 0)} is VALID [2022-04-15 05:59:32,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:32,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:32,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {415#false} is VALID [2022-04-15 05:59:32,153 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-15 05:59:32,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-15 05:59:32,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-15 05:59:32,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-15 05:59:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:32,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:32,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-15 05:59:32,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-15 05:59:32,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-15 05:59:32,232 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-15 05:59:32,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {415#false} is VALID [2022-04-15 05:59:32,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {479#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {475#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 05:59:32,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {479#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 05:59:32,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0; {483#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 05:59:32,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret4 := main(); {414#true} is VALID [2022-04-15 05:59:32,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-15 05:59:32,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-15 05:59:32,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-15 05:59:32,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-15 05:59:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:32,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881483916] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:32,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:32,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 05:59:32,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:32,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [929228383] [2022-04-15 05:59:32,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [929228383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:32,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:32,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:59:32,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858121307] [2022-04-15 05:59:32,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:32,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 05:59:32,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:32,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:32,250 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-15 05:59:32,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:59:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:59:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:59:32,251 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:32,345 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 05:59:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:59:32,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 05:59:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 05:59:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 05:59:32,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-15 05:59:32,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:32,370 INFO L225 Difference]: With dead ends: 20 [2022-04-15 05:59:32,374 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 05:59:32,375 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:59:32,381 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:32,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:59:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 05:59:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 05:59:32,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:32,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:32,390 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:32,391 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:32,394 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 05:59:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 05:59:32,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:32,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:32,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 05:59:32,395 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 05:59:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:32,399 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 05:59:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 05:59:32,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:32,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:32,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:32,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 05:59:32,402 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 05:59:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:32,402 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 05:59:32,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:32,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 05:59:32,416 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-15 05:59:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 05:59:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 05:59:32,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:32,417 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:32,443 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-15 05:59:32,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 05:59:32,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:32,840 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:32,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:32,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-15 05:59:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:32,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038323923] [2022-04-15 05:59:33,235 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:33,239 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1749097097, now seen corresponding path program 1 times [2022-04-15 05:59:33,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:33,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326571220] [2022-04-15 05:59:33,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:33,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:33,257 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_3.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_3.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 05:59:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:33,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671605374] [2022-04-15 05:59:33,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:33,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:33,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:33,280 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-15 05:59:33,281 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-15 05:59:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:33,343 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:33,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:33,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-15 05:59:33,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:33,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557300507] [2022-04-15 05:59:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:33,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:33,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-15 05:59:33,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-15 05:59:33,477 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-15 05:59:33,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:33,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-15 05:59:33,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-15 05:59:33,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-15 05:59:33,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret4 := main(); {610#true} is VALID [2022-04-15 05:59:33,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0; {615#(= main_~x~0 0)} is VALID [2022-04-15 05:59:33,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:33,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:33,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {618#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:33,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 268435455); {611#false} is VALID [2022-04-15 05:59:33,492 INFO L272 TraceCheckUtils]: 10: Hoare triple {611#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {611#false} is VALID [2022-04-15 05:59:33,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2022-04-15 05:59:33,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2022-04-15 05:59:33,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-15 05:59:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:33,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557300507] [2022-04-15 05:59:33,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557300507] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:33,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622408815] [2022-04-15 05:59:33,494 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:59:33,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:33,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:33,496 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-15 05:59:33,519 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-15 05:59:33,541 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:59:33,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:33,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 05:59:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:33,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:33,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-15 05:59:33,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-15 05:59:33,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-15 05:59:33,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-15 05:59:33,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret4 := main(); {610#true} is VALID [2022-04-15 05:59:33,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0; {615#(= main_~x~0 0)} is VALID [2022-04-15 05:59:33,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:33,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:33,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {647#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:33,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {647#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 268435455); {611#false} is VALID [2022-04-15 05:59:33,667 INFO L272 TraceCheckUtils]: 10: Hoare triple {611#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {611#false} is VALID [2022-04-15 05:59:33,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2022-04-15 05:59:33,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2022-04-15 05:59:33,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-15 05:59:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:33,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:33,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-15 05:59:33,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {611#false} is VALID [2022-04-15 05:59:33,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {666#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:59:33,891 INFO L272 TraceCheckUtils]: 10: Hoare triple {674#(< 0 (mod 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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {670#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:59:33,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {674#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 05:59:33,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {678#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 05:59:33,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {682#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 05:59:33,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {690#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {686#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 05:59:33,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0; {690#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 05:59:33,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret4 := main(); {610#true} is VALID [2022-04-15 05:59:33,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-15 05:59:33,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-15 05:59:33,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-15 05:59:33,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-15 05:59:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:33,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622408815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:33,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:33,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 15 [2022-04-15 05:59:33,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:33,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038323923] [2022-04-15 05:59:33,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038323923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:33,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:33,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:59:33,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924855179] [2022-04-15 05:59:33,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:33,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 05:59:33,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:33,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:33,918 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-15 05:59:33,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:59:33,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:33,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:59:33,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-04-15 05:59:33,919 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:34,073 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 05:59:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:59:34,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 05:59:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 05:59:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 05:59:34,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-15 05:59:34,097 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-15 05:59:34,098 INFO L225 Difference]: With dead ends: 21 [2022-04-15 05:59:34,098 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 05:59:34,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-04-15 05:59:34,099 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:34,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:59:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 05:59:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 05:59:34,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:34,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:34,111 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:34,112 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:34,116 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 05:59:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 05:59:34,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:34,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:34,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 05:59:34,117 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 05:59:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:34,118 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 05:59:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 05:59:34,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:34,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:34,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:34,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 05:59:34,120 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 05:59:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:34,120 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 05:59:34,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:34,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 05:59:34,136 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-15 05:59:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 05:59:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:59:34,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:34,137 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:34,145 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-15 05:59:34,354 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-15 05:59:34,538 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:34,538 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:34,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:34,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-15 05:59:34,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:34,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1459060040] [2022-04-15 05:59:34,803 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:34,805 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1689991753, now seen corresponding path program 1 times [2022-04-15 05:59:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:34,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509571057] [2022-04-15 05:59:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:34,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:34,817 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_4.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_4.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 05:59:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:34,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1883163844] [2022-04-15 05:59:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:34,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:34,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:34,840 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-15 05:59:34,841 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-15 05:59:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:34,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:34,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-15 05:59:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:34,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361399682] [2022-04-15 05:59:34,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:34,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:35,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-15 05:59:35,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-15 05:59:35,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-15 05:59:35,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:35,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-15 05:59:35,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-15 05:59:35,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-15 05:59:35,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret4 := main(); {825#true} is VALID [2022-04-15 05:59:35,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~x~0 := 0; {830#(= main_~x~0 0)} is VALID [2022-04-15 05:59:35,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {830#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:35,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:35,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:35,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {834#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:59:35,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {826#false} is VALID [2022-04-15 05:59:35,032 INFO L272 TraceCheckUtils]: 11: Hoare triple {826#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {826#false} is VALID [2022-04-15 05:59:35,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-15 05:59:35,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-15 05:59:35,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-15 05:59:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:35,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:35,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361399682] [2022-04-15 05:59:35,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361399682] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:35,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369017662] [2022-04-15 05:59:35,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:59:35,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:35,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:35,034 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-15 05:59:35,057 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-15 05:59:35,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:59:35,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:35,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 05:59:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:35,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:35,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2022-04-15 05:59:35,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-15 05:59:35,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-15 05:59:35,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-15 05:59:35,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret4 := main(); {825#true} is VALID [2022-04-15 05:59:35,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~x~0 := 0; {830#(= main_~x~0 0)} is VALID [2022-04-15 05:59:35,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {830#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:35,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:35,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:35,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {866#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:35,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {866#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {826#false} is VALID [2022-04-15 05:59:35,291 INFO L272 TraceCheckUtils]: 11: Hoare triple {826#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {826#false} is VALID [2022-04-15 05:59:35,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-15 05:59:35,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-15 05:59:35,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-15 05:59:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:35,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:35,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-15 05:59:35,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-15 05:59:35,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-15 05:59:35,422 INFO L272 TraceCheckUtils]: 11: Hoare triple {826#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {826#false} is VALID [2022-04-15 05:59:35,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {894#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {826#false} is VALID [2022-04-15 05:59:35,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {898#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {894#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 05:59:35,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {902#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {898#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 05:59:35,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {902#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 05:59:35,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {910#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {906#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 05:59:35,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~x~0 := 0; {910#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 05:59:35,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret4 := main(); {825#true} is VALID [2022-04-15 05:59:35,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-15 05:59:35,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-15 05:59:35,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-15 05:59:35,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2022-04-15 05:59:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:35,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369017662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:35,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:35,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 05:59:35,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:35,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1459060040] [2022-04-15 05:59:35,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1459060040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:35,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:35,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:59:35,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146628500] [2022-04-15 05:59:35,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:35,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:59:35,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:35,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:35,453 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-15 05:59:35,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:59:35,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:35,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:59:35,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:59:35,454 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:35,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:35,650 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 05:59:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:59:35,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 05:59:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 05:59:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 05:59:35,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 05:59:35,674 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-15 05:59:35,675 INFO L225 Difference]: With dead ends: 22 [2022-04-15 05:59:35,675 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 05:59:35,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-04-15 05:59:35,677 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:35,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:59:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 05:59:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 05:59:35,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:35,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:35,687 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:35,687 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:35,688 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 05:59:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 05:59:35,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:35,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:35,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 05:59:35,688 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 05:59:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:35,689 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 05:59:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 05:59:35,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:35,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:35,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:35,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 05:59:35,690 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-15 05:59:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:35,691 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 05:59:35,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:35,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 05:59:35,707 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-15 05:59:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 05:59:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 05:59:35,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:35,708 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:35,735 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-15 05:59:35,913 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-15 05:59:36,109 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8,SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:36,109 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-15 05:59:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:36,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417750240] [2022-04-15 05:59:38,373 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:38,375 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1630886409, now seen corresponding path program 1 times [2022-04-15 05:59:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:38,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526950558] [2022-04-15 05:59:38,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:38,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:38,386 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_5.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_5.0)) 4294967296)) 268435455) 0)) [2022-04-15 05:59:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:38,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446944744] [2022-04-15 05:59:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:38,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:38,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:38,398 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-15 05:59:38,413 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-15 05:59:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:38,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:38,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-15 05:59:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:38,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2522081] [2022-04-15 05:59:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:38,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:38,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-15 05:59:38,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-15 05:59:38,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-15 05:59:38,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:38,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-15 05:59:38,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-15 05:59:38,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-15 05:59:38,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret4 := main(); {1053#true} is VALID [2022-04-15 05:59:38,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} ~x~0 := 0; {1058#(= main_~x~0 0)} is VALID [2022-04-15 05:59:38,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {1058#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:38,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:38,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:38,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:38,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1063#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:59:38,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1054#false} is VALID [2022-04-15 05:59:38,612 INFO L272 TraceCheckUtils]: 12: 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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1054#false} is VALID [2022-04-15 05:59:38,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2022-04-15 05:59:38,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2022-04-15 05:59:38,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-04-15 05:59:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:38,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:38,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2522081] [2022-04-15 05:59:38,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2522081] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:38,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304528669] [2022-04-15 05:59:38,613 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:59:38,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:38,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:38,615 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-15 05:59:38,623 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-15 05:59:38,652 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:59:38,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:38,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 05:59:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:38,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:38,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2022-04-15 05:59:38,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-15 05:59:38,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-15 05:59:38,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-15 05:59:38,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret4 := main(); {1053#true} is VALID [2022-04-15 05:59:38,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} ~x~0 := 0; {1058#(= main_~x~0 0)} is VALID [2022-04-15 05:59:38,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {1058#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:38,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:38,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:38,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:38,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1098#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:38,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1054#false} is VALID [2022-04-15 05:59:38,904 INFO L272 TraceCheckUtils]: 12: 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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1054#false} is VALID [2022-04-15 05:59:38,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2022-04-15 05:59:38,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2022-04-15 05:59:38,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-04-15 05:59:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:38,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:39,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-04-15 05:59:39,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2022-04-15 05:59:39,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2022-04-15 05:59:39,053 INFO L272 TraceCheckUtils]: 12: 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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1054#false} is VALID [2022-04-15 05:59:39,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1054#false} is VALID [2022-04-15 05:59:39,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {1130#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1126#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 05:59:39,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {1134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1130#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 05:59:39,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 05:59:39,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {1142#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1138#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 05:59:39,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {1146#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1142#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 05:59:39,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} ~x~0 := 0; {1146#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 05:59:39,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret4 := main(); {1053#true} is VALID [2022-04-15 05:59:39,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-15 05:59:39,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-15 05:59:39,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-15 05:59:39,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2022-04-15 05:59:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:39,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304528669] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:39,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:39,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 05:59:39,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:39,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417750240] [2022-04-15 05:59:39,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417750240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:39,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:39,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:59:39,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721477574] [2022-04-15 05:59:39,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:39,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 05:59:39,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:39,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:39,074 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-15 05:59:39,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:59:39,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:39,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:59:39,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:59:39,076 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:39,259 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 05:59:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:59:39,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 05:59:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 05:59:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 05:59:39,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-15 05:59:39,280 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-15 05:59:39,281 INFO L225 Difference]: With dead ends: 23 [2022-04-15 05:59:39,281 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 05:59:39,281 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-04-15 05:59:39,282 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:39,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:59:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 05:59:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 05:59:39,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:39,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:39,294 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:39,294 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:39,295 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 05:59:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 05:59:39,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:39,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:39,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 05:59:39,296 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 05:59:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:39,296 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 05:59:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 05:59:39,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:39,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:39,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:39,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 05:59:39,298 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 05:59:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:39,298 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 05:59:39,298 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:39,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 05:59:39,315 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-15 05:59:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 05:59:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:59:39,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:39,316 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:39,333 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-15 05:59:39,520 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-15 05:59:39,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 05:59:39,717 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:39,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:39,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-15 05:59:39,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:39,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [702153219] [2022-04-15 05:59:40,002 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:40,004 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:40,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1571781065, now seen corresponding path program 1 times [2022-04-15 05:59:40,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:40,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673033334] [2022-04-15 05:59:40,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:40,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:40,031 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_6.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_6.0)) 4294967296)) 268435455) 0)) [2022-04-15 05:59:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:40,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [753928368] [2022-04-15 05:59:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:40,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:40,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:40,051 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-15 05:59:40,057 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-15 05:59:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:40,120 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:40,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:40,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-15 05:59:40,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:40,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016142765] [2022-04-15 05:59:40,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:40,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:40,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:40,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {1309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-15 05:59:40,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 05:59:40,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-15 05:59:40,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:40,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {1309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-15 05:59:40,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 05:59:40,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-15 05:59:40,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret4 := main(); {1297#true} is VALID [2022-04-15 05:59:40,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~x~0 := 0; {1302#(= main_~x~0 0)} is VALID [2022-04-15 05:59:40,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {1302#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:40,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:40,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:40,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:40,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:40,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1308#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:59:40,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {1308#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1298#false} is VALID [2022-04-15 05:59:40,290 INFO L272 TraceCheckUtils]: 13: Hoare triple {1298#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1298#false} is VALID [2022-04-15 05:59:40,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#false} ~cond := #in~cond; {1298#false} is VALID [2022-04-15 05:59:40,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#false} assume 0 == ~cond; {1298#false} is VALID [2022-04-15 05:59:40,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-15 05:59:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:40,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:40,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016142765] [2022-04-15 05:59:40,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016142765] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:40,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809482920] [2022-04-15 05:59:40,291 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:59:40,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:40,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:40,296 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-15 05:59:40,318 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-15 05:59:40,340 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 05:59:40,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:40,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 05:59:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:40,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:40,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1297#true} is VALID [2022-04-15 05:59:40,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-15 05:59:40,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 05:59:40,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-15 05:59:40,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret4 := main(); {1297#true} is VALID [2022-04-15 05:59:40,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~x~0 := 0; {1302#(= main_~x~0 0)} is VALID [2022-04-15 05:59:40,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {1302#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:40,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:40,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:40,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:40,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:40,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1346#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:40,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {1346#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1298#false} is VALID [2022-04-15 05:59:40,463 INFO L272 TraceCheckUtils]: 13: Hoare triple {1298#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1298#false} is VALID [2022-04-15 05:59:40,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#false} ~cond := #in~cond; {1298#false} is VALID [2022-04-15 05:59:40,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#false} assume 0 == ~cond; {1298#false} is VALID [2022-04-15 05:59:40,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-15 05:59:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:40,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:40,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-15 05:59:40,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {1365#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1298#false} is VALID [2022-04-15 05:59:40,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {1369#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1365#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:59:40,848 INFO L272 TraceCheckUtils]: 13: Hoare triple {1373#(< 0 (mod 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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1369#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:59:40,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {1377#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {1373#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 05:59:40,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {1381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1377#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 05:59:40,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {1385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 05:59:40,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {1389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 05:59:40,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {1393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 05:59:40,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {1397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 05:59:40,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {1401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 05:59:40,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~x~0 := 0; {1401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 05:59:40,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret4 := main(); {1297#true} is VALID [2022-04-15 05:59:40,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-15 05:59:40,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-15 05:59:40,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-15 05:59:40,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1297#true} is VALID [2022-04-15 05:59:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:40,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809482920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:40,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:40,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 12] total 21 [2022-04-15 05:59:40,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:40,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [702153219] [2022-04-15 05:59:40,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [702153219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:40,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:40,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:59:40,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000512222] [2022-04-15 05:59:40,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:40,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:59:40,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:40,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:40,874 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-15 05:59:40,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:59:40,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:40,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:59:40,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:59:40,875 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:41,126 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 05:59:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:59:41,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 05:59:41,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 05:59:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 05:59:41,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-15 05:59:41,153 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-15 05:59:41,153 INFO L225 Difference]: With dead ends: 24 [2022-04-15 05:59:41,153 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 05:59:41,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2022-04-15 05:59:41,154 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:41,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:59:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 05:59:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 05:59:41,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:41,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:41,169 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:41,169 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:41,170 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 05:59:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 05:59:41,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:41,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:41,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 05:59:41,170 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 05:59:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:41,171 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 05:59:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 05:59:41,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:41,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:41,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:41,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 05:59:41,173 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-15 05:59:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:41,173 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 05:59:41,173 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:41,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 05:59:41,193 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-15 05:59:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 05:59:41,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 05:59:41,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:41,194 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:41,201 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-15 05:59:41,420 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-15 05:59:41,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2022-04-15 05:59:41,599 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:41,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:41,599 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 13 times [2022-04-15 05:59:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:41,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [480670377] [2022-04-15 05:59:41,854 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:41,856 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1512675721, now seen corresponding path program 1 times [2022-04-15 05:59:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:41,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374592259] [2022-04-15 05:59:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:41,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:41,868 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_7.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_7.0)) 4294967296)) 268435455) 0)) [2022-04-15 05:59:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:41,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1209912471] [2022-04-15 05:59:41,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:41,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:41,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:41,888 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-15 05:59:41,912 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-15 05:59:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:41,956 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:41,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:41,967 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 14 times [2022-04-15 05:59:41,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:41,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921377540] [2022-04-15 05:59:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:41,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:42,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:42,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {1573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-15 05:59:42,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-15 05:59:42,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-15 05:59:42,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:42,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {1573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-15 05:59:42,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-15 05:59:42,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-15 05:59:42,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret4 := main(); {1560#true} is VALID [2022-04-15 05:59:42,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} ~x~0 := 0; {1565#(= main_~x~0 0)} is VALID [2022-04-15 05:59:42,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {1565#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:42,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:42,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:42,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:42,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:42,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:42,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1572#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:59:42,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {1572#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1561#false} is VALID [2022-04-15 05:59:42,143 INFO L272 TraceCheckUtils]: 14: Hoare triple {1561#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1561#false} is VALID [2022-04-15 05:59:42,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#false} ~cond := #in~cond; {1561#false} is VALID [2022-04-15 05:59:42,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#false} assume 0 == ~cond; {1561#false} is VALID [2022-04-15 05:59:42,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-15 05:59:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:42,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921377540] [2022-04-15 05:59:42,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921377540] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:42,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850338689] [2022-04-15 05:59:42,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:59:42,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:42,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:42,145 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-15 05:59:42,147 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-15 05:59:42,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:59:42,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:42,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 05:59:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:42,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:42,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-15 05:59:42,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-15 05:59:42,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-15 05:59:42,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-15 05:59:42,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret4 := main(); {1560#true} is VALID [2022-04-15 05:59:42,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} ~x~0 := 0; {1565#(= main_~x~0 0)} is VALID [2022-04-15 05:59:42,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {1565#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:42,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:42,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:42,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:42,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:42,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:42,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1613#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:42,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {1613#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 < 268435455); {1561#false} is VALID [2022-04-15 05:59:42,440 INFO L272 TraceCheckUtils]: 14: Hoare triple {1561#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1561#false} is VALID [2022-04-15 05:59:42,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#false} ~cond := #in~cond; {1561#false} is VALID [2022-04-15 05:59:42,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#false} assume 0 == ~cond; {1561#false} is VALID [2022-04-15 05:59:42,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-15 05:59:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:42,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:42,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-15 05:59:42,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#false} assume 0 == ~cond; {1561#false} is VALID [2022-04-15 05:59:42,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#false} ~cond := #in~cond; {1561#false} is VALID [2022-04-15 05:59:42,658 INFO L272 TraceCheckUtils]: 14: Hoare triple {1561#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1561#false} is VALID [2022-04-15 05:59:42,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {1641#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1561#false} is VALID [2022-04-15 05:59:42,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {1645#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1641#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 05:59:42,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {1649#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1645#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 05:59:42,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {1653#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1649#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 05:59:42,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {1657#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1653#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 05:59:42,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {1661#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1657#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 05:59:42,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1661#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 05:59:42,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {1669#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1665#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 05:59:42,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} ~x~0 := 0; {1669#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 05:59:42,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret4 := main(); {1560#true} is VALID [2022-04-15 05:59:42,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-15 05:59:42,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-15 05:59:42,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-15 05:59:42,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-15 05:59:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:42,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850338689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:42,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:42,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 05:59:42,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:42,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [480670377] [2022-04-15 05:59:42,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [480670377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:42,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:42,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 05:59:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926413314] [2022-04-15 05:59:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 05:59:42,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:42,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:42,692 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-15 05:59:42,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 05:59:42,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:42,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 05:59:42,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:59:42,693 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:42,950 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 05:59:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 05:59:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 05:59:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 05:59:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 05:59:42,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2022-04-15 05:59:42,974 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-15 05:59:42,975 INFO L225 Difference]: With dead ends: 25 [2022-04-15 05:59:42,975 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 05:59:42,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2022-04-15 05:59:42,981 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:42,981 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:59:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 05:59:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 05:59:42,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:42,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:42,996 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:42,996 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:42,997 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 05:59:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 05:59:42,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:42,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:42,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 05:59:42,998 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 05:59:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:42,999 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 05:59:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 05:59:42,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:42,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:42,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:42,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 05:59:43,005 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-15 05:59:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:43,006 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 05:59:43,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:43,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-15 05:59:43,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 05:59:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 05:59:43,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:43,049 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:43,053 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-15 05:59:43,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 05:59:43,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:43,450 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:43,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 15 times [2022-04-15 05:59:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:43,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1437083563] [2022-04-15 05:59:43,671 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:43,673 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:43,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1453570377, now seen corresponding path program 1 times [2022-04-15 05:59:43,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:43,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393963009] [2022-04-15 05:59:43,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:43,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:43,684 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_8.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_8.0)) 4294967296)) 268435455) 0)) [2022-04-15 05:59:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:43,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66212183] [2022-04-15 05:59:43,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:43,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:43,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:43,707 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-15 05:59:43,721 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-15 05:59:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:43,760 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:43,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 16 times [2022-04-15 05:59:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:43,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504495427] [2022-04-15 05:59:43,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:43,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:43,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {1850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 05:59:43,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 05:59:43,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-15 05:59:43,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:43,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {1850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 05:59:43,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 05:59:43,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-15 05:59:43,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret4 := main(); {1836#true} is VALID [2022-04-15 05:59:43,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1841#(= main_~x~0 0)} is VALID [2022-04-15 05:59:43,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:43,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:43,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:43,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:43,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:43,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:43,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:43,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1849#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:59:43,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1837#false} is VALID [2022-04-15 05:59:43,974 INFO L272 TraceCheckUtils]: 15: Hoare triple {1837#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1837#false} is VALID [2022-04-15 05:59:43,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {1837#false} ~cond := #in~cond; {1837#false} is VALID [2022-04-15 05:59:43,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {1837#false} assume 0 == ~cond; {1837#false} is VALID [2022-04-15 05:59:43,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-15 05:59:43,975 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-15 05:59:43,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:43,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504495427] [2022-04-15 05:59:43,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504495427] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:43,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818827674] [2022-04-15 05:59:43,975 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:59:43,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:43,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:43,980 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-15 05:59:43,998 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-15 05:59:44,019 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:59:44,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:44,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 05:59:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:44,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:44,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1836#true} is VALID [2022-04-15 05:59:44,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 05:59:44,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 05:59:44,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-15 05:59:44,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret4 := main(); {1836#true} is VALID [2022-04-15 05:59:44,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1841#(= main_~x~0 0)} is VALID [2022-04-15 05:59:44,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:44,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:44,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:44,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:44,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:44,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:44,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:44,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1893#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 05:59:44,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {1893#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1837#false} is VALID [2022-04-15 05:59:44,262 INFO L272 TraceCheckUtils]: 15: Hoare triple {1837#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1837#false} is VALID [2022-04-15 05:59:44,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {1837#false} ~cond := #in~cond; {1837#false} is VALID [2022-04-15 05:59:44,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {1837#false} assume 0 == ~cond; {1837#false} is VALID [2022-04-15 05:59:44,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-15 05:59:44,262 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-15 05:59:44,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:44,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-15 05:59:44,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {1837#false} assume 0 == ~cond; {1837#false} is VALID [2022-04-15 05:59:44,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {1837#false} ~cond := #in~cond; {1837#false} is VALID [2022-04-15 05:59:44,521 INFO L272 TraceCheckUtils]: 15: Hoare triple {1837#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1837#false} is VALID [2022-04-15 05:59:44,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {1921#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1837#false} is VALID [2022-04-15 05:59:44,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {1925#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1921#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 05:59:44,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {1929#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1925#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 05:59:44,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1929#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 05:59:44,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {1937#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1933#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 05:59:44,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {1941#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1937#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 05:59:44,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {1945#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1941#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 05:59:44,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {1949#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1945#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 05:59:44,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {1953#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1949#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 05:59:44,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1953#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 05:59:44,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret4 := main(); {1836#true} is VALID [2022-04-15 05:59:44,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-15 05:59:44,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 05:59:44,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 05:59:44,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1836#true} is VALID [2022-04-15 05:59:44,529 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-15 05:59:44,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818827674] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:44,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:44,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 05:59:44,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:44,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1437083563] [2022-04-15 05:59:44,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1437083563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:44,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:44,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 05:59:44,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612812454] [2022-04-15 05:59:44,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:44,531 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:59:44,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:44,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:44,545 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-15 05:59:44,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 05:59:44,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:44,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 05:59:44,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-04-15 05:59:44,546 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:44,930 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 05:59:44,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 05:59:44,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 05:59:44,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 05:59:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 05:59:44,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-15 05:59:44,960 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-15 05:59:44,961 INFO L225 Difference]: With dead ends: 26 [2022-04-15 05:59:44,961 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 05:59:44,961 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=657, Unknown=0, NotChecked=0, Total=930 [2022-04-15 05:59:44,962 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:44,962 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 58 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:59:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 05:59:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 05:59:44,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:44,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:44,978 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:44,978 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:44,979 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 05:59:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 05:59:44,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:44,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:44,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 05:59:44,980 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 05:59:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:44,981 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 05:59:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 05:59:44,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:44,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:44,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:44,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 05:59:44,982 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-15 05:59:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:44,982 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 05:59:44,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:44,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 05:59:45,001 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-15 05:59:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 05:59:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:59:45,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:45,001 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:45,018 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-15 05:59:45,209 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-15 05:59:45,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2022-04-15 05:59:45,404 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 17 times [2022-04-15 05:59:45,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:45,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1238639805] [2022-04-15 05:59:47,620 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:47,622 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:47,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1394465033, now seen corresponding path program 1 times [2022-04-15 05:59:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:47,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792123376] [2022-04-15 05:59:47,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:47,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:47,640 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_9.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_9.0)) 4294967296)) 268435455) 0)) [2022-04-15 05:59:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:47,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57574862] [2022-04-15 05:59:47,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:47,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:47,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:47,652 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-15 05:59:47,669 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-15 05:59:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:47,710 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:47,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:47,723 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 18 times [2022-04-15 05:59:47,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:47,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848538281] [2022-04-15 05:59:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:47,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:47,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:47,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {2143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-15 05:59:47,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-15 05:59:47,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-15 05:59:47,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:47,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {2143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-15 05:59:47,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-15 05:59:47,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-15 05:59:47,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {2128#true} call #t~ret4 := main(); {2128#true} is VALID [2022-04-15 05:59:47,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#true} ~x~0 := 0; {2133#(= main_~x~0 0)} is VALID [2022-04-15 05:59:47,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {2133#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:47,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:47,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:47,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:47,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:47,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:47,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:47,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 05:59:47,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2142#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:59:47,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {2142#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {2129#false} is VALID [2022-04-15 05:59:47,947 INFO L272 TraceCheckUtils]: 16: Hoare triple {2129#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2129#false} is VALID [2022-04-15 05:59:47,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2022-04-15 05:59:47,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {2129#false} assume 0 == ~cond; {2129#false} is VALID [2022-04-15 05:59:47,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2022-04-15 05:59:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:47,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:47,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848538281] [2022-04-15 05:59:47,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848538281] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:47,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077923196] [2022-04-15 05:59:47,949 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:59:47,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:47,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:47,950 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-15 05:59:47,952 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-15 05:59:48,013 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 05:59:48,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:48,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 05:59:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:48,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:48,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2022-04-15 05:59:48,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {2128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-15 05:59:48,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-15 05:59:48,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-15 05:59:48,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {2128#true} call #t~ret4 := main(); {2128#true} is VALID [2022-04-15 05:59:48,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#true} ~x~0 := 0; {2133#(= main_~x~0 0)} is VALID [2022-04-15 05:59:48,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {2133#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:48,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:48,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:48,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:48,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:48,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:48,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:48,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 05:59:48,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2189#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 05:59:48,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {2189#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2129#false} is VALID [2022-04-15 05:59:48,301 INFO L272 TraceCheckUtils]: 16: Hoare triple {2129#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2129#false} is VALID [2022-04-15 05:59:48,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2022-04-15 05:59:48,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {2129#false} assume 0 == ~cond; {2129#false} is VALID [2022-04-15 05:59:48,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2022-04-15 05:59:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:48,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:48,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2022-04-15 05:59:48,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {2129#false} assume 0 == ~cond; {2129#false} is VALID [2022-04-15 05:59:48,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2022-04-15 05:59:48,571 INFO L272 TraceCheckUtils]: 16: Hoare triple {2129#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2129#false} is VALID [2022-04-15 05:59:48,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {2217#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2129#false} is VALID [2022-04-15 05:59:48,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {2221#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2217#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 05:59:48,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {2225#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2221#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 05:59:48,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {2229#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2225#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 05:59:48,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {2233#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2229#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 05:59:48,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {2237#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2233#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 05:59:48,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {2241#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2237#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 05:59:48,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {2245#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2241#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 05:59:48,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {2249#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2245#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 05:59:48,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {2253#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2249#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 05:59:48,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#true} ~x~0 := 0; {2253#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 05:59:48,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {2128#true} call #t~ret4 := main(); {2128#true} is VALID [2022-04-15 05:59:48,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-15 05:59:48,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-15 05:59:48,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {2128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-15 05:59:48,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2022-04-15 05:59:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:48,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077923196] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:48,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:48,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 05:59:48,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:48,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1238639805] [2022-04-15 05:59:48,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1238639805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:48,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:48,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 05:59:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059256615] [2022-04-15 05:59:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:48,580 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:59:48,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:48,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:48,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:48,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 05:59:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:48,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 05:59:48,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-15 05:59:48,598 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:49,028 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 05:59:49,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 05:59:49,028 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 05:59:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 05:59:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 05:59:49,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2022-04-15 05:59:49,054 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-15 05:59:49,054 INFO L225 Difference]: With dead ends: 27 [2022-04-15 05:59:49,054 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 05:59:49,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 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-15 05:59:49,055 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:49,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:59:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 05:59:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 05:59:49,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:49,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:49,072 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:49,072 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:49,073 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 05:59:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 05:59:49,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:49,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:49,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 05:59:49,074 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 05:59:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:49,075 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 05:59:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 05:59:49,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:49,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:49,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:49,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-15 05:59:49,076 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-15 05:59:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:49,076 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-15 05:59:49,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:49,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-15 05:59:49,097 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-15 05:59:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 05:59:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:59:49,097 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:49,097 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:49,103 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-15 05:59:49,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 05:59:49,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:49,498 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:49,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 19 times [2022-04-15 05:59:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:49,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1176152743] [2022-04-15 05:59:49,813 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:49,814 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:49,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1335359689, now seen corresponding path program 1 times [2022-04-15 05:59:49,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:49,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786438426] [2022-04-15 05:59:49,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:49,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:49,821 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_10.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_10.0)) 4294967296)) 268435455) 0)) [2022-04-15 05:59:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:49,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058195540] [2022-04-15 05:59:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:49,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:49,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:49,830 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-15 05:59:49,855 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-15 05:59:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:49,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:49,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 20 times [2022-04-15 05:59:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:49,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258535948] [2022-04-15 05:59:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:50,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {2452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-15 05:59:50,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-15 05:59:50,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-15 05:59:50,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:50,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {2452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-15 05:59:50,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-15 05:59:50,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-15 05:59:50,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret4 := main(); {2436#true} is VALID [2022-04-15 05:59:50,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~x~0 := 0; {2441#(= main_~x~0 0)} is VALID [2022-04-15 05:59:50,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {2441#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:50,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:50,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:50,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:50,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:50,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:50,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:50,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 05:59:50,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 05:59:50,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2451#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:59:50,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {2451#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {2437#false} is VALID [2022-04-15 05:59:50,120 INFO L272 TraceCheckUtils]: 17: Hoare triple {2437#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2437#false} is VALID [2022-04-15 05:59:50,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-15 05:59:50,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-15 05:59:50,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-15 05:59:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:50,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:50,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258535948] [2022-04-15 05:59:50,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258535948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:50,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173283465] [2022-04-15 05:59:50,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:59:50,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:50,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:50,123 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-15 05:59:50,138 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-15 05:59:50,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:59:50,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:50,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 05:59:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:50,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:50,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2436#true} is VALID [2022-04-15 05:59:50,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-15 05:59:50,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-15 05:59:50,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-15 05:59:50,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret4 := main(); {2436#true} is VALID [2022-04-15 05:59:50,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~x~0 := 0; {2441#(= main_~x~0 0)} is VALID [2022-04-15 05:59:50,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {2441#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:50,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:50,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:50,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:50,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:50,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:50,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:50,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 05:59:50,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 05:59:50,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2501#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 05:59:50,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {2501#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2437#false} is VALID [2022-04-15 05:59:50,446 INFO L272 TraceCheckUtils]: 17: Hoare triple {2437#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2437#false} is VALID [2022-04-15 05:59:50,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-15 05:59:50,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-15 05:59:50,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-15 05:59:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:50,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:50,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-15 05:59:50,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-15 05:59:50,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-15 05:59:50,732 INFO L272 TraceCheckUtils]: 17: Hoare triple {2437#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2437#false} is VALID [2022-04-15 05:59:50,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {2529#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2437#false} is VALID [2022-04-15 05:59:50,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {2533#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2529#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 05:59:50,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {2537#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2533#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 05:59:50,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {2541#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2537#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 05:59:50,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {2545#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2541#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 05:59:50,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {2549#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2545#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 05:59:50,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {2553#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2549#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 05:59:50,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2553#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 05:59:50,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {2561#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2557#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 05:59:50,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {2565#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2561#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 05:59:50,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {2569#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2565#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 05:59:50,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~x~0 := 0; {2569#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 05:59:50,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret4 := main(); {2436#true} is VALID [2022-04-15 05:59:50,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-15 05:59:50,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-15 05:59:50,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-15 05:59:50,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2436#true} is VALID [2022-04-15 05:59:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:50,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173283465] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:50,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:50,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 05:59:50,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:50,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1176152743] [2022-04-15 05:59:50,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1176152743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:50,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:50,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 05:59:50,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409119323] [2022-04-15 05:59:50,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:50,742 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 05:59:50,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:50,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:50,756 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-15 05:59:50,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 05:59:50,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:50,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 05:59:50,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-15 05:59:50,757 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:51,172 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 05:59:51,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 05:59:51,172 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 05:59:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 05:59:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 05:59:51,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-15 05:59:51,199 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-15 05:59:51,199 INFO L225 Difference]: With dead ends: 28 [2022-04-15 05:59:51,199 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 05:59:51,200 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 05:59:51,200 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:51,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:59:51,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 05:59:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 05:59:51,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:51,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:51,222 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:51,223 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:51,223 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 05:59:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 05:59:51,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:51,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:51,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 05:59:51,224 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 05:59:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:51,224 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 05:59:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 05:59:51,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:51,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:51,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:51,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 05:59:51,226 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-15 05:59:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:51,226 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 05:59:51,226 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:51,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 05:59:51,261 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-15 05:59:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 05:59:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:59:51,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:51,262 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:51,290 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-15 05:59:51,470 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-15 05:59:51,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:51,663 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:51,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 21 times [2022-04-15 05:59:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:51,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1065219345] [2022-04-15 05:59:51,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:51,862 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1276254345, now seen corresponding path program 1 times [2022-04-15 05:59:51,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:51,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991983891] [2022-04-15 05:59:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:51,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:51,869 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_11.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_11.0)) 4294967296)) 268435455) 0)) [2022-04-15 05:59:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:51,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1745305923] [2022-04-15 05:59:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:51,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:51,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:51,880 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-15 05:59:51,881 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-15 05:59:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:51,966 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:51,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 22 times [2022-04-15 05:59:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:51,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263888187] [2022-04-15 05:59:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:51,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:52,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {2777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-15 05:59:52,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-15 05:59:52,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-15 05:59:52,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {2760#true} call ULTIMATE.init(); {2777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:52,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-15 05:59:52,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-15 05:59:52,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-15 05:59:52,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {2760#true} call #t~ret4 := main(); {2760#true} is VALID [2022-04-15 05:59:52,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {2760#true} ~x~0 := 0; {2765#(= main_~x~0 0)} is VALID [2022-04-15 05:59:52,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {2765#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:52,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:52,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:52,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:52,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:52,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:52,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:52,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 05:59:52,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 05:59:52,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 05:59:52,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2776#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-15 05:59:52,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {2776#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 268435455); {2761#false} is VALID [2022-04-15 05:59:52,198 INFO L272 TraceCheckUtils]: 18: Hoare triple {2761#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2761#false} is VALID [2022-04-15 05:59:52,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#false} ~cond := #in~cond; {2761#false} is VALID [2022-04-15 05:59:52,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {2761#false} assume 0 == ~cond; {2761#false} is VALID [2022-04-15 05:59:52,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {2761#false} assume !false; {2761#false} is VALID [2022-04-15 05:59:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:52,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263888187] [2022-04-15 05:59:52,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263888187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:52,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298341681] [2022-04-15 05:59:52,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:59:52,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:52,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:52,201 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-15 05:59:52,202 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-15 05:59:52,230 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:59:52,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:52,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 05:59:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:52,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:52,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {2760#true} call ULTIMATE.init(); {2760#true} is VALID [2022-04-15 05:59:52,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {2760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-15 05:59:52,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-15 05:59:52,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-15 05:59:52,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {2760#true} call #t~ret4 := main(); {2760#true} is VALID [2022-04-15 05:59:52,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {2760#true} ~x~0 := 0; {2765#(= main_~x~0 0)} is VALID [2022-04-15 05:59:52,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {2765#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:52,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:52,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:52,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:52,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:52,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:52,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:52,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 05:59:52,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 05:59:52,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 05:59:52,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2829#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 05:59:52,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {2829#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 268435455); {2761#false} is VALID [2022-04-15 05:59:52,556 INFO L272 TraceCheckUtils]: 18: Hoare triple {2761#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2761#false} is VALID [2022-04-15 05:59:52,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#false} ~cond := #in~cond; {2761#false} is VALID [2022-04-15 05:59:52,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {2761#false} assume 0 == ~cond; {2761#false} is VALID [2022-04-15 05:59:52,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {2761#false} assume !false; {2761#false} is VALID [2022-04-15 05:59:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:52,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:52,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {2761#false} assume !false; {2761#false} is VALID [2022-04-15 05:59:52,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {2761#false} assume 0 == ~cond; {2761#false} is VALID [2022-04-15 05:59:52,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#false} ~cond := #in~cond; {2761#false} is VALID [2022-04-15 05:59:52,908 INFO L272 TraceCheckUtils]: 18: Hoare triple {2761#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2761#false} is VALID [2022-04-15 05:59:52,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {2857#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2761#false} is VALID [2022-04-15 05:59:52,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {2861#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2857#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {2865#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2861#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {2869#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2865#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {2873#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2869#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {2877#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2873#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {2881#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2877#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {2885#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2881#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {2889#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2885#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {2893#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2889#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {2897#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2893#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {2901#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2897#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {2760#true} ~x~0 := 0; {2901#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 05:59:52,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {2760#true} call #t~ret4 := main(); {2760#true} is VALID [2022-04-15 05:59:52,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-15 05:59:52,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-15 05:59:52,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {2760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-15 05:59:52,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {2760#true} call ULTIMATE.init(); {2760#true} is VALID [2022-04-15 05:59:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:52,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298341681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:52,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:52,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 05:59:52,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:52,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1065219345] [2022-04-15 05:59:52,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1065219345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:52,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:52,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 05:59:52,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751659795] [2022-04-15 05:59:52,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:52,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:59:52,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:52,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:52,935 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-15 05:59:52,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 05:59:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:52,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 05:59:52,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-04-15 05:59:52,936 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:53,374 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 05:59:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 05:59:53,374 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 05:59:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 05:59:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 05:59:53,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-15 05:59:53,404 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-15 05:59:53,404 INFO L225 Difference]: With dead ends: 29 [2022-04-15 05:59:53,404 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 05:59:53,405 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 05:59:53,406 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:53,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:59:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 05:59:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 05:59:53,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:53,426 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-15 05:59:53,427 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-15 05:59:53,427 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-15 05:59:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:53,428 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 05:59:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 05:59:53,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:53,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:53,428 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-15 05:59:53,428 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-15 05:59:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:53,429 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 05:59:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 05:59:53,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:53,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:53,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:53,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:53,430 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-15 05:59:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 05:59:53,430 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-15 05:59:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:53,430 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 05:59:53,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:53,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 05:59:53,452 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-15 05:59:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 05:59:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:59:53,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:53,452 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:53,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 05:59:53,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-15 05:59:53,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:53,853 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 23 times [2022-04-15 05:59:53,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:53,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [106073272] [2022-04-15 05:59:55,934 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:59:56,043 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:56,044 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1217149001, now seen corresponding path program 1 times [2022-04-15 05:59:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:56,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306149061] [2022-04-15 05:59:56,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:56,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:56,052 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_12.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_12.0)) 4294967296)) 268435455) 0)) [2022-04-15 05:59:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:56,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2065244026] [2022-04-15 05:59:56,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:56,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:56,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:56,061 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-15 05:59:56,061 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-15 05:59:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:56,103 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:56,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:56,118 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 24 times [2022-04-15 05:59:56,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:56,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240837959] [2022-04-15 05:59:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:56,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:56,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-15 05:59:56,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-15 05:59:56,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-15 05:59:56,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {3100#true} call ULTIMATE.init(); {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:56,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-15 05:59:56,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-15 05:59:56,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-15 05:59:56,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {3100#true} call #t~ret4 := main(); {3100#true} is VALID [2022-04-15 05:59:56,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {3100#true} ~x~0 := 0; {3105#(= main_~x~0 0)} is VALID [2022-04-15 05:59:56,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {3105#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:56,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:56,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:56,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:56,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:56,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:56,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:56,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 05:59:56,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 05:59:56,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 05:59:56,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 05:59:56,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3117#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:59:56,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {3117#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {3101#false} is VALID [2022-04-15 05:59:56,339 INFO L272 TraceCheckUtils]: 19: Hoare triple {3101#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3101#false} is VALID [2022-04-15 05:59:56,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {3101#false} ~cond := #in~cond; {3101#false} is VALID [2022-04-15 05:59:56,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {3101#false} assume 0 == ~cond; {3101#false} is VALID [2022-04-15 05:59:56,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {3101#false} assume !false; {3101#false} is VALID [2022-04-15 05:59:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:56,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:56,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240837959] [2022-04-15 05:59:56,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240837959] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:56,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209209623] [2022-04-15 05:59:56,340 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:59:56,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:56,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:56,344 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-15 05:59:56,367 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-15 05:59:56,457 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 05:59:56,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:56,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 05:59:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:56,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:56,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {3100#true} call ULTIMATE.init(); {3100#true} is VALID [2022-04-15 05:59:56,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {3100#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-15 05:59:56,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-15 05:59:56,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-15 05:59:56,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {3100#true} call #t~ret4 := main(); {3100#true} is VALID [2022-04-15 05:59:56,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {3100#true} ~x~0 := 0; {3105#(= main_~x~0 0)} is VALID [2022-04-15 05:59:56,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {3105#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:56,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:56,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:56,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:56,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:56,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:56,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:56,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 05:59:56,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 05:59:56,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 05:59:56,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 05:59:56,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3173#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 05:59:56,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {3173#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3101#false} is VALID [2022-04-15 05:59:56,650 INFO L272 TraceCheckUtils]: 19: Hoare triple {3101#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3101#false} is VALID [2022-04-15 05:59:56,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {3101#false} ~cond := #in~cond; {3101#false} is VALID [2022-04-15 05:59:56,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {3101#false} assume 0 == ~cond; {3101#false} is VALID [2022-04-15 05:59:56,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {3101#false} assume !false; {3101#false} is VALID [2022-04-15 05:59:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:56,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:57,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {3101#false} assume !false; {3101#false} is VALID [2022-04-15 05:59:57,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {3192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3101#false} is VALID [2022-04-15 05:59:57,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {3196#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:59:57,361 INFO L272 TraceCheckUtils]: 19: Hoare triple {3200#(not (= (mod main_~x~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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:59:57,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {3204#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {3200#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 05:59:57,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {3208#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3204#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 05:59:57,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {3212#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3208#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 05:59:57,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {3216#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3212#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 05:59:57,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {3220#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3216#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 05:59:57,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {3224#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3220#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 05:59:57,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {3228#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3224#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 05:59:57,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {3232#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3228#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 05:59:57,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {3236#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3232#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 05:59:57,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {3240#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3236#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 05:59:57,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {3244#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3240#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 05:59:57,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {3248#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3244#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 05:59:57,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {3252#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3248#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 05:59:57,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {3100#true} ~x~0 := 0; {3252#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 05:59:57,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {3100#true} call #t~ret4 := main(); {3100#true} is VALID [2022-04-15 05:59:57,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-15 05:59:57,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-15 05:59:57,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {3100#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-15 05:59:57,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {3100#true} call ULTIMATE.init(); {3100#true} is VALID [2022-04-15 05:59:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:57,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209209623] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:57,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:57,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 18] total 33 [2022-04-15 05:59:57,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:57,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [106073272] [2022-04-15 05:59:57,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [106073272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:57,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:57,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 05:59:57,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504043303] [2022-04-15 05:59:57,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:57,375 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 05:59:57,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:57,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:57,395 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-15 05:59:57,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 05:59:57,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:57,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 05:59:57,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 05:59:57,397 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:57,868 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 05:59:57,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 05:59:57,869 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 05:59:57,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 05:59:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 05:59:57,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-15 05:59:57,895 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-15 05:59:57,896 INFO L225 Difference]: With dead ends: 30 [2022-04-15 05:59:57,896 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 05:59:57,897 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=516, Invalid=1554, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 05:59:57,897 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:57,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:59:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 05:59:57,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 05:59:57,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:57,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:57,920 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:57,920 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:57,921 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 05:59:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 05:59:57,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:57,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:57,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 05:59:57,921 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 05:59:57,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:57,922 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 05:59:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 05:59:57,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:57,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:57,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:57,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 05:59:57,923 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-15 05:59:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:57,923 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 05:59:57,924 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:57,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 05:59:57,950 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-15 05:59:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 05:59:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:59:57,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:57,950 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:57,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-15 05:59:58,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 05:59:58,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:58,355 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:58,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 25 times [2022-04-15 05:59:58,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:58,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2072621171] [2022-04-15 05:59:58,567 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:58,569 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:59:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1158043657, now seen corresponding path program 1 times [2022-04-15 05:59:58,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:58,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300058255] [2022-04-15 05:59:58,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:58,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:58,578 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_13.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_13.0)) 4294967296)) 268435455) 0)) [2022-04-15 05:59:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 05:59:58,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283270716] [2022-04-15 05:59:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:58,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:58,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:58,590 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-15 05:59:58,592 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-15 05:59:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:58,639 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:59:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:59:58,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:59:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 26 times [2022-04-15 05:59:58,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:58,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663696327] [2022-04-15 05:59:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:58,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:58,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {3478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-15 05:59:58,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-15 05:59:58,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-15 05:59:58,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {3459#true} call ULTIMATE.init(); {3478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:58,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {3478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-15 05:59:58,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-15 05:59:58,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-15 05:59:58,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {3459#true} call #t~ret4 := main(); {3459#true} is VALID [2022-04-15 05:59:58,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {3459#true} ~x~0 := 0; {3464#(= main_~x~0 0)} is VALID [2022-04-15 05:59:58,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {3464#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:58,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:58,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:58,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:58,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:58,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:58,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:58,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 05:59:58,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 05:59:58,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 05:59:58,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 05:59:58,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 05:59:58,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3477#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 05:59:58,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {3477#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !(~x~0 % 4294967296 < 268435455); {3460#false} is VALID [2022-04-15 05:59:58,904 INFO L272 TraceCheckUtils]: 20: Hoare triple {3460#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3460#false} is VALID [2022-04-15 05:59:58,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {3460#false} ~cond := #in~cond; {3460#false} is VALID [2022-04-15 05:59:58,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {3460#false} assume 0 == ~cond; {3460#false} is VALID [2022-04-15 05:59:58,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {3460#false} assume !false; {3460#false} is VALID [2022-04-15 05:59:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:58,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663696327] [2022-04-15 05:59:58,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663696327] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:58,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529837899] [2022-04-15 05:59:58,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:59:58,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:58,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:58,906 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-15 05:59:58,907 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-15 05:59:58,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:59:58,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:58,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 05:59:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:58,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:59,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {3459#true} call ULTIMATE.init(); {3459#true} is VALID [2022-04-15 05:59:59,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {3459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-15 05:59:59,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-15 05:59:59,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-15 05:59:59,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {3459#true} call #t~ret4 := main(); {3459#true} is VALID [2022-04-15 05:59:59,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {3459#true} ~x~0 := 0; {3464#(= main_~x~0 0)} is VALID [2022-04-15 05:59:59,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {3464#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 05:59:59,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 05:59:59,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 05:59:59,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 05:59:59,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 05:59:59,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 05:59:59,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 05:59:59,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 05:59:59,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 05:59:59,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 05:59:59,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 05:59:59,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 05:59:59,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3536#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 05:59:59,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {3536#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3460#false} is VALID [2022-04-15 05:59:59,228 INFO L272 TraceCheckUtils]: 20: Hoare triple {3460#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3460#false} is VALID [2022-04-15 05:59:59,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {3460#false} ~cond := #in~cond; {3460#false} is VALID [2022-04-15 05:59:59,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {3460#false} assume 0 == ~cond; {3460#false} is VALID [2022-04-15 05:59:59,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {3460#false} assume !false; {3460#false} is VALID [2022-04-15 05:59:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:59,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:59,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {3460#false} assume !false; {3460#false} is VALID [2022-04-15 05:59:59,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {3460#false} assume 0 == ~cond; {3460#false} is VALID [2022-04-15 05:59:59,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {3460#false} ~cond := #in~cond; {3460#false} is VALID [2022-04-15 05:59:59,684 INFO L272 TraceCheckUtils]: 20: Hoare triple {3460#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3460#false} is VALID [2022-04-15 05:59:59,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {3564#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3460#false} is VALID [2022-04-15 05:59:59,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {3568#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3564#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {3572#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3568#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {3576#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3572#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {3580#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3576#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {3584#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3580#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {3588#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3584#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {3592#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3588#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3592#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {3600#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3596#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {3604#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3600#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {3608#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3604#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {3612#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3608#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {3616#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3612#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {3459#true} ~x~0 := 0; {3616#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 05:59:59,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {3459#true} call #t~ret4 := main(); {3459#true} is VALID [2022-04-15 05:59:59,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-15 05:59:59,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-15 05:59:59,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {3459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-15 05:59:59,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {3459#true} call ULTIMATE.init(); {3459#true} is VALID [2022-04-15 05:59:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:59:59,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529837899] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:59,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:59,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 05:59:59,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:59,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2072621171] [2022-04-15 05:59:59,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2072621171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:59,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:59,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 05:59:59,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052959638] [2022-04-15 05:59:59,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:59,695 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 05:59:59,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:59,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:59:59,718 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-15 05:59:59,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 05:59:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 05:59:59,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-15 05:59:59,719 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:00,330 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 06:00:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:00:00,330 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 06:00:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 06:00:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 06:00:00,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-15 06:00:00,365 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-15 06:00:00,366 INFO L225 Difference]: With dead ends: 31 [2022-04-15 06:00:00,366 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 06:00:00,367 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=563, Invalid=1507, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:00:00,367 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:00,367 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:00:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 06:00:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 06:00:00,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:00,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:00,388 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:00,388 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:00,388 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 06:00:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 06:00:00,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:00,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:00,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 06:00:00,389 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 06:00:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:00,389 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 06:00:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 06:00:00,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:00,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:00,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:00,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:00,390 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-15 06:00:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-15 06:00:00,390 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-15 06:00:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:00,391 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-15 06:00:00,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:00,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-15 06:00:00,429 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-15 06:00:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 06:00:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:00:00,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:00,430 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:00,446 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-15 06:00:00,634 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-15 06:00:00,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2022-04-15 06:00:00,831 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:00,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:00,831 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 27 times [2022-04-15 06:00:00,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:00,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [592150388] [2022-04-15 06:00:02,920 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:00:03,026 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:03,029 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1098938313, now seen corresponding path program 1 times [2022-04-15 06:00:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:03,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831636776] [2022-04-15 06:00:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:03,036 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_14.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_14.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:03,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [557176633] [2022-04-15 06:00:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:03,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:03,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:03,049 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-15 06:00:03,051 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-15 06:00:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:03,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:03,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 28 times [2022-04-15 06:00:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:03,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026177012] [2022-04-15 06:00:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:03,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:03,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {3851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-15 06:00:03,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-15 06:00:03,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-15 06:00:03,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:03,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-15 06:00:03,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-15 06:00:03,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-15 06:00:03,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret4 := main(); {3831#true} is VALID [2022-04-15 06:00:03,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~x~0 := 0; {3836#(= main_~x~0 0)} is VALID [2022-04-15 06:00:03,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {3836#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:03,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:03,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:03,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:03,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:03,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:03,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:03,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:03,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:03,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:03,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:03,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:03,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:03,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3850#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:03,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {3850#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 268435455); {3832#false} is VALID [2022-04-15 06:00:03,408 INFO L272 TraceCheckUtils]: 21: Hoare triple {3832#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3832#false} is VALID [2022-04-15 06:00:03,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {3832#false} ~cond := #in~cond; {3832#false} is VALID [2022-04-15 06:00:03,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {3832#false} assume 0 == ~cond; {3832#false} is VALID [2022-04-15 06:00:03,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-15 06:00:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:03,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:03,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026177012] [2022-04-15 06:00:03,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026177012] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:03,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073231709] [2022-04-15 06:00:03,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:00:03,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:03,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:03,410 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-15 06:00:03,412 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-15 06:00:03,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:00:03,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:03,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 06:00:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:03,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:03,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3831#true} is VALID [2022-04-15 06:00:03,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-15 06:00:03,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-15 06:00:03,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-15 06:00:03,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret4 := main(); {3831#true} is VALID [2022-04-15 06:00:03,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~x~0 := 0; {3836#(= main_~x~0 0)} is VALID [2022-04-15 06:00:03,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {3836#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:03,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:03,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:03,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:03,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:03,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:03,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:03,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:03,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:03,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:03,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:03,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:03,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:03,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3912#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:03,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {3912#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 268435455); {3832#false} is VALID [2022-04-15 06:00:03,780 INFO L272 TraceCheckUtils]: 21: Hoare triple {3832#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3832#false} is VALID [2022-04-15 06:00:03,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {3832#false} ~cond := #in~cond; {3832#false} is VALID [2022-04-15 06:00:03,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {3832#false} assume 0 == ~cond; {3832#false} is VALID [2022-04-15 06:00:03,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-15 06:00:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:03,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:04,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-15 06:00:04,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {3832#false} assume 0 == ~cond; {3832#false} is VALID [2022-04-15 06:00:04,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {3832#false} ~cond := #in~cond; {3832#false} is VALID [2022-04-15 06:00:04,243 INFO L272 TraceCheckUtils]: 21: Hoare triple {3832#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3832#false} is VALID [2022-04-15 06:00:04,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {3940#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3832#false} is VALID [2022-04-15 06:00:04,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {3944#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3940#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {3948#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3944#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {3952#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3948#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {3956#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3952#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {3960#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3956#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {3964#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3960#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {3968#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3964#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {3972#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3968#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {3976#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3972#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {3980#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3976#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {3984#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3980#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {3988#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3984#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {3992#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3988#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {3996#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3992#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~x~0 := 0; {3996#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:00:04,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret4 := main(); {3831#true} is VALID [2022-04-15 06:00:04,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-15 06:00:04,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-15 06:00:04,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-15 06:00:04,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3831#true} is VALID [2022-04-15 06:00:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:04,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073231709] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:04,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:04,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 06:00:04,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:04,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [592150388] [2022-04-15 06:00:04,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [592150388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:04,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:04,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:00:04,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108663857] [2022-04-15 06:00:04,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:04,254 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:00:04,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:04,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:04,269 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-15 06:00:04,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:00:04,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:04,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:00:04,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:00:04,270 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:04,874 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 06:00:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:00:04,874 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:00:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 06:00:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 06:00:04,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-15 06:00:04,901 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-15 06:00:04,901 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:00:04,901 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:00:04,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=633, Invalid=1719, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:00:04,903 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:04,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:00:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:00:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 06:00:04,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:04,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:04,934 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:04,934 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:04,936 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 06:00:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 06:00:04,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:04,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:04,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:00:04,936 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:00:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:04,938 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 06:00:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 06:00:04,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:04,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:04,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:04,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 06:00:04,939 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-15 06:00:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:04,939 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 06:00:04,939 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:04,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 06:00:04,969 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-15 06:00:04,969 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 06:00:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:00:04,969 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:04,969 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:04,976 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-15 06:00:05,190 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-15 06:00:05,374 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 06:00:05,374 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 29 times [2022-04-15 06:00:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:05,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [523638051] [2022-04-15 06:00:05,555 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:05,556 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:05,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1039832969, now seen corresponding path program 1 times [2022-04-15 06:00:05,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:05,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671050564] [2022-04-15 06:00:05,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:05,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:05,563 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_15.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_15.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:05,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327051531] [2022-04-15 06:00:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:05,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:05,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:05,575 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-15 06:00:05,577 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-15 06:00:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:05,615 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:05,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 30 times [2022-04-15 06:00:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:05,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751724319] [2022-04-15 06:00:05,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:05,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-15 06:00:05,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-15 06:00:05,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-15 06:00:05,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:05,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-15 06:00:05,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-15 06:00:05,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-15 06:00:05,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret4 := main(); {4219#true} is VALID [2022-04-15 06:00:05,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {4219#true} ~x~0 := 0; {4224#(= main_~x~0 0)} is VALID [2022-04-15 06:00:05,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:05,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:05,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:05,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:05,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:05,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:05,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:05,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:05,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:05,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:05,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:05,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:05,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:05,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:05,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4239#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:00:05,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {4239#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {4220#false} is VALID [2022-04-15 06:00:05,919 INFO L272 TraceCheckUtils]: 22: Hoare triple {4220#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4220#false} is VALID [2022-04-15 06:00:05,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {4220#false} ~cond := #in~cond; {4220#false} is VALID [2022-04-15 06:00:05,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#false} assume 0 == ~cond; {4220#false} is VALID [2022-04-15 06:00:05,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2022-04-15 06:00:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:05,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:05,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751724319] [2022-04-15 06:00:05,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751724319] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:05,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118895386] [2022-04-15 06:00:05,920 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:00:05,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:05,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:05,924 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-15 06:00:05,939 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-15 06:00:05,985 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 06:00:05,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:05,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:00:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:05,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:06,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4219#true} is VALID [2022-04-15 06:00:06,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {4219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-15 06:00:06,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-15 06:00:06,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-15 06:00:06,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret4 := main(); {4219#true} is VALID [2022-04-15 06:00:06,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {4219#true} ~x~0 := 0; {4224#(= main_~x~0 0)} is VALID [2022-04-15 06:00:06,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:06,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:06,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:06,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:06,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:06,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:06,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:06,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:06,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:06,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:06,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:06,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:06,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:06,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:06,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4304#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:06,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {4304#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 268435455); {4220#false} is VALID [2022-04-15 06:00:06,222 INFO L272 TraceCheckUtils]: 22: Hoare triple {4220#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4220#false} is VALID [2022-04-15 06:00:06,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {4220#false} ~cond := #in~cond; {4220#false} is VALID [2022-04-15 06:00:06,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#false} assume 0 == ~cond; {4220#false} is VALID [2022-04-15 06:00:06,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2022-04-15 06:00:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:06,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:07,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2022-04-15 06:00:07,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {4323#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4220#false} is VALID [2022-04-15 06:00:07,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {4327#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4323#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:00:07,252 INFO L272 TraceCheckUtils]: 22: Hoare triple {4331#(< 0 (mod 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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4327#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:00:07,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {4335#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {4331#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 06:00:07,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {4339#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4335#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {4343#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4339#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {4347#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4343#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {4351#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4347#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {4355#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4351#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {4359#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4355#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {4363#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4359#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {4367#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4363#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {4371#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4367#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {4375#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4371#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {4379#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4375#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {4383#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4379#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {4387#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4383#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {4391#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4387#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {4395#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4391#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {4219#true} ~x~0 := 0; {4395#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:00:07,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret4 := main(); {4219#true} is VALID [2022-04-15 06:00:07,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-15 06:00:07,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-15 06:00:07,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {4219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-15 06:00:07,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4219#true} is VALID [2022-04-15 06:00:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:07,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118895386] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:07,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:07,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 21] total 39 [2022-04-15 06:00:07,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:07,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [523638051] [2022-04-15 06:00:07,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [523638051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:07,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:07,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:00:07,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986676056] [2022-04-15 06:00:07,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:07,275 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:00:07,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:07,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:07,297 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-15 06:00:07,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:00:07,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:07,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:00:07,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1103, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:00:07,298 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:08,162 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 06:00:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:00:08,163 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:00:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 06:00:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 06:00:08,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-15 06:00:08,201 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-15 06:00:08,202 INFO L225 Difference]: With dead ends: 33 [2022-04-15 06:00:08,202 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 06:00:08,203 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=729, Invalid=2241, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:00:08,203 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:08,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:00:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 06:00:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 06:00:08,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:08,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:08,246 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:08,246 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:08,247 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 06:00:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 06:00:08,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:08,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:08,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 06:00:08,247 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 06:00:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:08,248 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 06:00:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 06:00:08,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:08,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:08,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:08,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:08,249 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-15 06:00:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-15 06:00:08,249 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-15 06:00:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:08,249 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-15 06:00:08,249 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:08,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-15 06:00:08,278 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-15 06:00:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 06:00:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:00:08,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:08,279 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:08,306 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-15 06:00:08,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-15 06:00:08,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:08,680 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:08,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 31 times [2022-04-15 06:00:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:08,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1850239034] [2022-04-15 06:00:08,916 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:08,918 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:08,921 INFO L85 PathProgramCache]: Analyzing trace with hash -980727625, now seen corresponding path program 1 times [2022-04-15 06:00:08,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:08,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493717558] [2022-04-15 06:00:08,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:08,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:08,927 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_16.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_16.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:08,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937396511] [2022-04-15 06:00:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:08,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:08,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:08,939 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-15 06:00:08,947 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-15 06:00:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:09,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:09,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:09,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 32 times [2022-04-15 06:00:09,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:09,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370553852] [2022-04-15 06:00:09,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:09,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:09,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:09,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {4648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-15 06:00:09,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-15 06:00:09,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-15 06:00:09,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {4626#true} call ULTIMATE.init(); {4648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:09,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {4648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-15 06:00:09,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-15 06:00:09,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-15 06:00:09,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {4626#true} call #t~ret4 := main(); {4626#true} is VALID [2022-04-15 06:00:09,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#true} ~x~0 := 0; {4631#(= main_~x~0 0)} is VALID [2022-04-15 06:00:09,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {4631#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:09,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:09,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:09,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:09,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:09,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:09,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:09,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:09,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:09,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:09,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:09,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:09,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:09,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:09,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:09,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4647#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:00:09,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {4647#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {4627#false} is VALID [2022-04-15 06:00:09,365 INFO L272 TraceCheckUtils]: 23: Hoare triple {4627#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4627#false} is VALID [2022-04-15 06:00:09,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#false} ~cond := #in~cond; {4627#false} is VALID [2022-04-15 06:00:09,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {4627#false} assume 0 == ~cond; {4627#false} is VALID [2022-04-15 06:00:09,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#false} assume !false; {4627#false} is VALID [2022-04-15 06:00:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:09,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:09,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370553852] [2022-04-15 06:00:09,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370553852] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:09,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709797] [2022-04-15 06:00:09,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:00:09,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:09,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:09,367 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-15 06:00:09,368 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-15 06:00:09,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:00:09,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:09,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 06:00:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:09,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:09,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {4626#true} call ULTIMATE.init(); {4626#true} is VALID [2022-04-15 06:00:09,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-15 06:00:09,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-15 06:00:09,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-15 06:00:09,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {4626#true} call #t~ret4 := main(); {4626#true} is VALID [2022-04-15 06:00:09,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#true} ~x~0 := 0; {4631#(= main_~x~0 0)} is VALID [2022-04-15 06:00:09,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {4631#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:09,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:09,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:09,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:09,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:09,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:09,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:09,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:09,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:09,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:09,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:09,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:09,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:09,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:09,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:09,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4715#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:09,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {4715#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {4627#false} is VALID [2022-04-15 06:00:09,772 INFO L272 TraceCheckUtils]: 23: Hoare triple {4627#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4627#false} is VALID [2022-04-15 06:00:09,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#false} ~cond := #in~cond; {4627#false} is VALID [2022-04-15 06:00:09,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {4627#false} assume 0 == ~cond; {4627#false} is VALID [2022-04-15 06:00:09,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#false} assume !false; {4627#false} is VALID [2022-04-15 06:00:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:09,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:10,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#false} assume !false; {4627#false} is VALID [2022-04-15 06:00:10,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {4627#false} assume 0 == ~cond; {4627#false} is VALID [2022-04-15 06:00:10,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#false} ~cond := #in~cond; {4627#false} is VALID [2022-04-15 06:00:10,574 INFO L272 TraceCheckUtils]: 23: Hoare triple {4627#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4627#false} is VALID [2022-04-15 06:00:10,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {4743#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {4627#false} is VALID [2022-04-15 06:00:10,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {4747#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4743#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {4751#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4747#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {4755#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4751#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {4759#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4755#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {4763#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4759#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {4767#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4763#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {4771#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4767#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {4775#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4771#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {4779#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4775#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {4783#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4779#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {4787#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4783#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {4791#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4787#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {4795#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4791#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {4799#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4795#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {4803#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4799#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {4807#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4803#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#true} ~x~0 := 0; {4807#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:10,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {4626#true} call #t~ret4 := main(); {4626#true} is VALID [2022-04-15 06:00:10,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-15 06:00:10,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-15 06:00:10,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-15 06:00:10,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {4626#true} call ULTIMATE.init(); {4626#true} is VALID [2022-04-15 06:00:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:10,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:10,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:10,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 06:00:10,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:10,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1850239034] [2022-04-15 06:00:10,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1850239034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:10,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:10,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:00:10,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141221585] [2022-04-15 06:00:10,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:00:10,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:10,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:10,611 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-15 06:00:10,611 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:00:10,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:10,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:00:10,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1010, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:00:10,613 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:11,531 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 06:00:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:00:11,532 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:00:11,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 06:00:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 06:00:11,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-15 06:00:11,573 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-15 06:00:11,574 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:00:11,574 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 06:00:11,575 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:00:11,575 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:11,576 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:00:11,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 06:00:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 06:00:11,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:11,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:11,779 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:11,779 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:11,780 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 06:00:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 06:00:11,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:11,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:11,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:00:11,781 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:00:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:11,781 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 06:00:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 06:00:11,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:11,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:11,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:11,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-15 06:00:11,782 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-15 06:00:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:11,783 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-15 06:00:11,783 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:11,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-15 06:00:11,824 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-15 06:00:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 06:00:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:00:11,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:11,825 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:11,846 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-15 06:00:12,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 06:00:12,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:12,226 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:12,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:12,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 33 times [2022-04-15 06:00:12,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:12,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [406271432] [2022-04-15 06:00:12,485 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:12,487 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:12,489 INFO L85 PathProgramCache]: Analyzing trace with hash -921622281, now seen corresponding path program 1 times [2022-04-15 06:00:12,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:12,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591327501] [2022-04-15 06:00:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:12,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:12,495 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_17.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_17.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:12,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778491034] [2022-04-15 06:00:12,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:12,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:12,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:12,539 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-15 06:00:12,565 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-15 06:00:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:12,607 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:12,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 34 times [2022-04-15 06:00:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:12,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739374287] [2022-04-15 06:00:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:13,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:13,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {5069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-15 06:00:13,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-15 06:00:13,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-15 06:00:13,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {5046#true} call ULTIMATE.init(); {5069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:13,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {5069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-15 06:00:13,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-15 06:00:13,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-15 06:00:13,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {5046#true} call #t~ret4 := main(); {5046#true} is VALID [2022-04-15 06:00:13,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {5046#true} ~x~0 := 0; {5051#(= main_~x~0 0)} is VALID [2022-04-15 06:00:13,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {5051#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:13,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:13,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:13,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:13,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:13,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:13,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:13,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:13,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:13,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:13,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:13,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:13,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:13,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:13,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:13,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:13,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5068#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:00:13,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5047#false} is VALID [2022-04-15 06:00:13,031 INFO L272 TraceCheckUtils]: 24: Hoare triple {5047#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5047#false} is VALID [2022-04-15 06:00:13,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {5047#false} ~cond := #in~cond; {5047#false} is VALID [2022-04-15 06:00:13,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#false} assume 0 == ~cond; {5047#false} is VALID [2022-04-15 06:00:13,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {5047#false} assume !false; {5047#false} is VALID [2022-04-15 06:00:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:13,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:13,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739374287] [2022-04-15 06:00:13,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739374287] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:13,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534019719] [2022-04-15 06:00:13,032 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:00:13,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:13,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:13,033 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-15 06:00:13,034 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-15 06:00:13,073 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:00:13,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:13,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 06:00:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:13,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:13,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {5046#true} call ULTIMATE.init(); {5046#true} is VALID [2022-04-15 06:00:13,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {5046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-15 06:00:13,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-15 06:00:13,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-15 06:00:13,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {5046#true} call #t~ret4 := main(); {5046#true} is VALID [2022-04-15 06:00:13,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {5046#true} ~x~0 := 0; {5051#(= main_~x~0 0)} is VALID [2022-04-15 06:00:13,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {5051#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:13,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:13,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:13,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:13,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:13,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:13,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:13,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:13,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:13,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:13,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:13,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:13,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:13,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:13,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:13,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:13,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5139#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:13,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {5139#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5047#false} is VALID [2022-04-15 06:00:13,375 INFO L272 TraceCheckUtils]: 24: Hoare triple {5047#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5047#false} is VALID [2022-04-15 06:00:13,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {5047#false} ~cond := #in~cond; {5047#false} is VALID [2022-04-15 06:00:13,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#false} assume 0 == ~cond; {5047#false} is VALID [2022-04-15 06:00:13,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {5047#false} assume !false; {5047#false} is VALID [2022-04-15 06:00:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:13,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:14,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {5047#false} assume !false; {5047#false} is VALID [2022-04-15 06:00:14,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#false} assume 0 == ~cond; {5047#false} is VALID [2022-04-15 06:00:14,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {5047#false} ~cond := #in~cond; {5047#false} is VALID [2022-04-15 06:00:14,031 INFO L272 TraceCheckUtils]: 24: Hoare triple {5047#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5047#false} is VALID [2022-04-15 06:00:14,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {5167#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {5047#false} is VALID [2022-04-15 06:00:14,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {5171#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5167#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {5175#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5171#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {5179#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5175#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {5183#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5179#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {5187#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5183#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {5191#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5187#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {5195#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5191#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {5199#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5195#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {5203#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5199#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {5207#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5203#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {5211#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5207#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {5215#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5211#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {5219#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5215#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5219#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {5227#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5223#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {5231#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5227#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {5235#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5231#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {5046#true} ~x~0 := 0; {5235#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:00:14,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {5046#true} call #t~ret4 := main(); {5046#true} is VALID [2022-04-15 06:00:14,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-15 06:00:14,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-15 06:00:14,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {5046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-15 06:00:14,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {5046#true} call ULTIMATE.init(); {5046#true} is VALID [2022-04-15 06:00:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:14,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534019719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:14,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:14,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 06:00:14,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:14,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [406271432] [2022-04-15 06:00:14,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [406271432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:14,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:14,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:00:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174522724] [2022-04-15 06:00:14,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:14,048 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 06:00:14,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:14,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:14,068 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-15 06:00:14,069 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:00:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:14,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:00:14,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:00:14,070 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:15,012 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 06:00:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:00:15,012 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 06:00:15,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 06:00:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 06:00:15,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-15 06:00:15,048 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-15 06:00:15,049 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:00:15,049 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:00:15,050 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=867, Invalid=2439, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:00:15,050 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:15,051 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:00:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:00:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 06:00:15,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:15,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:15,080 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:15,080 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:15,081 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 06:00:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 06:00:15,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:15,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:15,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 06:00:15,081 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 06:00:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:15,085 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 06:00:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 06:00:15,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:15,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:15,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:15,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:15,086 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-15 06:00:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-15 06:00:15,087 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-15 06:00:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:15,087 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-15 06:00:15,087 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:15,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-15 06:00:15,119 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-15 06:00:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 06:00:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:00:15,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:15,121 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:15,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-15 06:00:15,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-15 06:00:15,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35 [2022-04-15 06:00:15,527 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 35 times [2022-04-15 06:00:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:15,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [527207015] [2022-04-15 06:00:15,685 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:15,687 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:15,689 INFO L85 PathProgramCache]: Analyzing trace with hash -862516937, now seen corresponding path program 1 times [2022-04-15 06:00:15,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:15,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948291163] [2022-04-15 06:00:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:15,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:15,694 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_18.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_18.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:15,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893014111] [2022-04-15 06:00:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:15,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:15,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:15,704 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-15 06:00:15,706 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-15 06:00:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:15,764 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:15,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:15,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 36 times [2022-04-15 06:00:15,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:15,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743199063] [2022-04-15 06:00:15,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:15,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:16,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:16,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {5506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-15 06:00:16,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-15 06:00:16,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-15 06:00:16,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {5482#true} call ULTIMATE.init(); {5506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:16,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {5506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-15 06:00:16,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-15 06:00:16,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-15 06:00:16,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {5482#true} call #t~ret4 := main(); {5482#true} is VALID [2022-04-15 06:00:16,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {5482#true} ~x~0 := 0; {5487#(= main_~x~0 0)} is VALID [2022-04-15 06:00:16,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {5487#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:16,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:16,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:16,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:16,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:16,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:16,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:16,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:16,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:16,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:16,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:16,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:16,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:16,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:16,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:16,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:16,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:16,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5505#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:00:16,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {5505#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5483#false} is VALID [2022-04-15 06:00:16,139 INFO L272 TraceCheckUtils]: 25: Hoare triple {5483#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5483#false} is VALID [2022-04-15 06:00:16,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {5483#false} ~cond := #in~cond; {5483#false} is VALID [2022-04-15 06:00:16,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {5483#false} assume 0 == ~cond; {5483#false} is VALID [2022-04-15 06:00:16,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {5483#false} assume !false; {5483#false} is VALID [2022-04-15 06:00:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:16,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743199063] [2022-04-15 06:00:16,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743199063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:16,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578823904] [2022-04-15 06:00:16,140 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:00:16,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:16,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:16,148 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-15 06:00:16,150 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-15 06:00:16,279 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 06:00:16,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:16,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 06:00:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:16,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:16,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {5482#true} call ULTIMATE.init(); {5482#true} is VALID [2022-04-15 06:00:16,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {5482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-15 06:00:16,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-15 06:00:16,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-15 06:00:16,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {5482#true} call #t~ret4 := main(); {5482#true} is VALID [2022-04-15 06:00:16,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {5482#true} ~x~0 := 0; {5487#(= main_~x~0 0)} is VALID [2022-04-15 06:00:16,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {5487#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:16,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:16,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:16,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:16,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:16,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:16,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:16,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:16,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:16,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:16,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:16,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:16,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:16,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:16,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:16,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:16,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:16,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5579#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:16,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {5579#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5483#false} is VALID [2022-04-15 06:00:16,504 INFO L272 TraceCheckUtils]: 25: Hoare triple {5483#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5483#false} is VALID [2022-04-15 06:00:16,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {5483#false} ~cond := #in~cond; {5483#false} is VALID [2022-04-15 06:00:16,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {5483#false} assume 0 == ~cond; {5483#false} is VALID [2022-04-15 06:00:16,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {5483#false} assume !false; {5483#false} is VALID [2022-04-15 06:00:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:16,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:19,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {5483#false} assume !false; {5483#false} is VALID [2022-04-15 06:00:19,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {5598#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5483#false} is VALID [2022-04-15 06:00:19,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {5602#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5598#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:00:19,714 INFO L272 TraceCheckUtils]: 25: Hoare triple {5606#(not (= (mod main_~x~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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:00:19,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {5610#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5606#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:00:19,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {5614#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5610#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:19,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {5618#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5614#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:19,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {5622#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5618#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:19,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {5626#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5622#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:00:19,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {5630#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5626#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:00:19,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {5634#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5630#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:00:19,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {5638#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5634#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:00:19,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {5642#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5638#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:19,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {5646#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5642#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:19,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {5650#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5646#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-15 06:00:19,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {5654#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5650#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-15 06:00:19,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {5658#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5654#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:00:19,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {5662#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5658#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:00:19,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {5666#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5662#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:00:19,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {5670#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5666#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} is VALID [2022-04-15 06:00:19,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {5674#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5670#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:19,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {5678#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5674#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:00:19,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {5682#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5678#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:19,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {5482#true} ~x~0 := 0; {5682#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-15 06:00:19,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {5482#true} call #t~ret4 := main(); {5482#true} is VALID [2022-04-15 06:00:19,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-15 06:00:19,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-15 06:00:19,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {5482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-15 06:00:19,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {5482#true} call ULTIMATE.init(); {5482#true} is VALID [2022-04-15 06:00:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:19,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578823904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:19,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:19,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 24] total 45 [2022-04-15 06:00:19,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:19,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [527207015] [2022-04-15 06:00:19,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [527207015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:19,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:19,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:00:19,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518615777] [2022-04-15 06:00:19,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:19,740 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 06:00:19,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:19,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:19,763 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-15 06:00:19,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:00:19,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:19,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:00:19,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1475, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:00:19,765 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:20,833 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 06:00:20,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:00:20,833 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 06:00:20,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 06:00:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 06:00:20,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-15 06:00:20,874 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-15 06:00:20,875 INFO L225 Difference]: With dead ends: 36 [2022-04-15 06:00:20,875 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 06:00:20,877 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=978, Invalid=3054, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:00:20,877 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:20,877 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:00:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 06:00:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 06:00:20,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:20,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:20,912 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:20,912 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:20,914 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 06:00:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 06:00:20,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:20,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:20,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 06:00:20,914 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 06:00:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:20,915 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 06:00:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 06:00:20,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:20,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:20,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:20,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 06:00:20,916 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-15 06:00:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:20,916 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 06:00:20,916 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:20,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 06:00:20,945 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-15 06:00:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 06:00:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 06:00:20,946 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:20,946 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:20,954 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-15 06:00:21,154 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-15 06:00:21,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:21,347 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 37 times [2022-04-15 06:00:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:21,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [280509721] [2022-04-15 06:00:21,591 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:21,593 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash -803411593, now seen corresponding path program 1 times [2022-04-15 06:00:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:21,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567780585] [2022-04-15 06:00:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:21,601 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_19.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_19.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:21,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [458373156] [2022-04-15 06:00:21,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:21,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:21,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:21,620 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-15 06:00:21,620 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-15 06:00:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:21,680 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:21,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:21,718 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 38 times [2022-04-15 06:00:21,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:21,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648360889] [2022-04-15 06:00:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:21,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:22,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:22,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {5962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-15 06:00:22,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-15 06:00:22,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-15 06:00:22,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {5937#true} call ULTIMATE.init(); {5962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:22,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {5962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-15 06:00:22,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-15 06:00:22,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-15 06:00:22,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {5937#true} call #t~ret4 := main(); {5937#true} is VALID [2022-04-15 06:00:22,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {5937#true} ~x~0 := 0; {5942#(= main_~x~0 0)} is VALID [2022-04-15 06:00:22,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {5942#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:22,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:22,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:22,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:22,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:22,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:22,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:22,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:22,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:22,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:22,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:22,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:22,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:22,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:22,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:22,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:22,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:22,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:22,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5961#(and (<= main_~x~0 38) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:00:22,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {5961#(and (<= main_~x~0 38) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5938#false} is VALID [2022-04-15 06:00:22,212 INFO L272 TraceCheckUtils]: 26: Hoare triple {5938#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5938#false} is VALID [2022-04-15 06:00:22,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {5938#false} ~cond := #in~cond; {5938#false} is VALID [2022-04-15 06:00:22,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {5938#false} assume 0 == ~cond; {5938#false} is VALID [2022-04-15 06:00:22,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {5938#false} assume !false; {5938#false} is VALID [2022-04-15 06:00:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:22,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:22,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648360889] [2022-04-15 06:00:22,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648360889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:22,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370617907] [2022-04-15 06:00:22,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:00:22,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:22,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:22,215 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-15 06:00:22,216 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-15 06:00:22,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:00:22,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:22,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 06:00:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:22,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:22,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {5937#true} call ULTIMATE.init(); {5937#true} is VALID [2022-04-15 06:00:22,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {5937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-15 06:00:22,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-15 06:00:22,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-15 06:00:22,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {5937#true} call #t~ret4 := main(); {5937#true} is VALID [2022-04-15 06:00:22,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {5937#true} ~x~0 := 0; {5942#(= main_~x~0 0)} is VALID [2022-04-15 06:00:22,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {5942#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:22,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:22,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:22,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:22,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:22,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:22,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:22,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:22,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:22,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:22,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:22,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:22,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:22,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:22,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:22,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:22,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:22,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:22,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6038#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:22,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {6038#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5938#false} is VALID [2022-04-15 06:00:22,733 INFO L272 TraceCheckUtils]: 26: Hoare triple {5938#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5938#false} is VALID [2022-04-15 06:00:22,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {5938#false} ~cond := #in~cond; {5938#false} is VALID [2022-04-15 06:00:22,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {5938#false} assume 0 == ~cond; {5938#false} is VALID [2022-04-15 06:00:22,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {5938#false} assume !false; {5938#false} is VALID [2022-04-15 06:00:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:22,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:23,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {5938#false} assume !false; {5938#false} is VALID [2022-04-15 06:00:23,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {5938#false} assume 0 == ~cond; {5938#false} is VALID [2022-04-15 06:00:23,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {5938#false} ~cond := #in~cond; {5938#false} is VALID [2022-04-15 06:00:23,639 INFO L272 TraceCheckUtils]: 26: Hoare triple {5938#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5938#false} is VALID [2022-04-15 06:00:23,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {6066#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {5938#false} is VALID [2022-04-15 06:00:23,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {6070#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6066#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {6074#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6070#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {6078#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6074#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {6082#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6078#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {6086#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6082#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {6090#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6086#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {6094#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6090#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {6098#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6094#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {6102#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6098#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {6106#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6102#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {6110#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6106#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {6114#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6110#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {6118#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6114#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {6122#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6118#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {6126#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6122#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {6130#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6126#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {6134#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6130#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {6138#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6134#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {6142#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6138#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {5937#true} ~x~0 := 0; {6142#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:00:23,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {5937#true} call #t~ret4 := main(); {5937#true} is VALID [2022-04-15 06:00:23,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-15 06:00:23,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-15 06:00:23,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {5937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-15 06:00:23,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {5937#true} call ULTIMATE.init(); {5937#true} is VALID [2022-04-15 06:00:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:23,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370617907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:23,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:23,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 06:00:23,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:23,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [280509721] [2022-04-15 06:00:23,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [280509721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:23,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:23,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:00:23,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700351616] [2022-04-15 06:00:23,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:23,661 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 06:00:23,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:23,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:23,686 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-15 06:00:23,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:00:23,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:23,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:00:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=1367, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:00:23,688 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:24,952 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 06:00:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:00:24,952 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 06:00:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 06:00:24,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 06:00:24,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-15 06:00:24,993 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-15 06:00:24,994 INFO L225 Difference]: With dead ends: 37 [2022-04-15 06:00:24,994 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 06:00:24,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1043, Invalid=2989, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:00:24,996 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:24,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:00:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 06:00:25,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 06:00:25,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:25,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:25,029 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:25,029 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:25,035 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 06:00:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 06:00:25,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:25,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:25,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 06:00:25,036 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 06:00:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:25,041 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 06:00:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 06:00:25,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:25,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:25,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:25,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:25,042 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-15 06:00:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-15 06:00:25,043 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-15 06:00:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:25,043 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-15 06:00:25,043 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:25,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-15 06:00:25,073 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-15 06:00:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 06:00:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:00:25,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:25,074 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:25,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 06:00:25,281 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-15 06:00:25,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2022-04-15 06:00:25,475 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 39 times [2022-04-15 06:00:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:25,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2063521997] [2022-04-15 06:00:25,743 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:25,745 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash -744306249, now seen corresponding path program 1 times [2022-04-15 06:00:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:25,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351787041] [2022-04-15 06:00:25,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:25,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:25,753 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_20.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_20.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:25,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26446175] [2022-04-15 06:00:25,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:25,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:25,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:25,777 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-15 06:00:25,778 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-15 06:00:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:25,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:25,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 40 times [2022-04-15 06:00:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:25,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968037362] [2022-04-15 06:00:25,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:25,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:26,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:26,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {6431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-15 06:00:26,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-15 06:00:26,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-15 06:00:26,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {6405#true} call ULTIMATE.init(); {6431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:26,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {6431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-15 06:00:26,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-15 06:00:26,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-15 06:00:26,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {6405#true} call #t~ret4 := main(); {6405#true} is VALID [2022-04-15 06:00:26,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {6405#true} ~x~0 := 0; {6410#(= main_~x~0 0)} is VALID [2022-04-15 06:00:26,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {6410#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:26,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:26,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:26,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:26,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:26,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:26,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:26,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:26,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:26,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:26,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:26,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:26,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:26,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:26,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:26,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:26,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:26,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:26,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:26,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6430#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-15 06:00:26,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {6430#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} assume !(~x~0 % 4294967296 < 268435455); {6406#false} is VALID [2022-04-15 06:00:26,330 INFO L272 TraceCheckUtils]: 27: Hoare triple {6406#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6406#false} is VALID [2022-04-15 06:00:26,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {6406#false} ~cond := #in~cond; {6406#false} is VALID [2022-04-15 06:00:26,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {6406#false} assume 0 == ~cond; {6406#false} is VALID [2022-04-15 06:00:26,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {6406#false} assume !false; {6406#false} is VALID [2022-04-15 06:00:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:26,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:26,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968037362] [2022-04-15 06:00:26,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968037362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:26,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626840067] [2022-04-15 06:00:26,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:00:26,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:26,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:26,332 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-15 06:00:26,332 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-15 06:00:26,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:00:26,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:26,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 06:00:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:26,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:26,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {6405#true} call ULTIMATE.init(); {6405#true} is VALID [2022-04-15 06:00:26,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {6405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-15 06:00:26,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-15 06:00:26,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-15 06:00:26,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {6405#true} call #t~ret4 := main(); {6405#true} is VALID [2022-04-15 06:00:26,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {6405#true} ~x~0 := 0; {6410#(= main_~x~0 0)} is VALID [2022-04-15 06:00:26,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {6410#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:26,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:26,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:26,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:26,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:26,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:26,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:26,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:26,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:26,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:26,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:26,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:26,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:26,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:26,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:26,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:26,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:26,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:26,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:26,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6510#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:26,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {6510#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {6406#false} is VALID [2022-04-15 06:00:26,744 INFO L272 TraceCheckUtils]: 27: Hoare triple {6406#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6406#false} is VALID [2022-04-15 06:00:26,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {6406#false} ~cond := #in~cond; {6406#false} is VALID [2022-04-15 06:00:26,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {6406#false} assume 0 == ~cond; {6406#false} is VALID [2022-04-15 06:00:26,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {6406#false} assume !false; {6406#false} is VALID [2022-04-15 06:00:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:26,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:27,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {6406#false} assume !false; {6406#false} is VALID [2022-04-15 06:00:27,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {6406#false} assume 0 == ~cond; {6406#false} is VALID [2022-04-15 06:00:27,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {6406#false} ~cond := #in~cond; {6406#false} is VALID [2022-04-15 06:00:27,635 INFO L272 TraceCheckUtils]: 27: Hoare triple {6406#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6406#false} is VALID [2022-04-15 06:00:27,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {6538#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {6406#false} is VALID [2022-04-15 06:00:27,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {6542#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6538#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {6546#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6542#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {6550#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6546#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {6554#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6550#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {6558#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6554#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {6562#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6558#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {6566#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6562#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {6570#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6566#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {6574#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6570#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {6578#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6574#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {6582#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6578#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {6586#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6582#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {6590#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6586#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {6594#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6590#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {6598#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6594#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {6602#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6598#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {6606#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6602#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {6610#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6606#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {6614#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6610#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {6618#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6614#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {6405#true} ~x~0 := 0; {6618#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:27,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {6405#true} call #t~ret4 := main(); {6405#true} is VALID [2022-04-15 06:00:27,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-15 06:00:27,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-15 06:00:27,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {6405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-15 06:00:27,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {6405#true} call ULTIMATE.init(); {6405#true} is VALID [2022-04-15 06:00:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:27,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626840067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:27,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:27,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-15 06:00:27,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:27,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2063521997] [2022-04-15 06:00:27,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2063521997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:27,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:27,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:00:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823101653] [2022-04-15 06:00:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:27,652 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 06:00:27,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:27,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:27,671 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-15 06:00:27,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:00:27,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:00:27,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:00:27,672 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:28,835 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 06:00:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:00:28,836 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 06:00:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 06:00:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 06:00:28,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-15 06:00:28,866 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-15 06:00:28,866 INFO L225 Difference]: With dead ends: 38 [2022-04-15 06:00:28,866 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 06:00:28,868 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1137, Invalid=3285, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 06:00:28,868 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:28,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:00:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 06:00:28,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 06:00:28,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:28,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:28,903 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:28,903 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:28,904 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 06:00:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 06:00:28,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:28,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:28,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 06:00:28,904 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 06:00:28,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:28,905 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 06:00:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 06:00:28,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:28,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:28,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:28,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-15 06:00:28,905 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-15 06:00:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:28,906 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-15 06:00:28,906 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:28,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-15 06:00:28,935 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-15 06:00:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 06:00:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:00:28,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:28,935 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:28,952 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-15 06:00:29,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-15 06:00:29,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-15 06:00:29,341 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:29,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:29,341 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 41 times [2022-04-15 06:00:29,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:29,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152901324] [2022-04-15 06:00:29,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:29,572 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:29,574 INFO L85 PathProgramCache]: Analyzing trace with hash -685200905, now seen corresponding path program 1 times [2022-04-15 06:00:29,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:29,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684560677] [2022-04-15 06:00:29,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:29,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:29,581 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_21.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_21.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:29,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876658848] [2022-04-15 06:00:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:29,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:29,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:29,600 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-15 06:00:29,602 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-15 06:00:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:29,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:29,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 42 times [2022-04-15 06:00:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:29,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104072697] [2022-04-15 06:00:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:30,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:30,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {6916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-15 06:00:30,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-15 06:00:30,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-15 06:00:30,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {6889#true} call ULTIMATE.init(); {6916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:30,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {6916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-15 06:00:30,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-15 06:00:30,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-15 06:00:30,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {6889#true} call #t~ret4 := main(); {6889#true} is VALID [2022-04-15 06:00:30,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {6889#true} ~x~0 := 0; {6894#(= main_~x~0 0)} is VALID [2022-04-15 06:00:30,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {6894#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:30,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:30,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:30,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:30,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:30,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:30,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:30,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:30,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:30,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:30,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:30,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:30,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:30,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:30,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:30,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:30,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:30,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:30,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:30,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:30,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6915#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:00:30,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {6915#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {6890#false} is VALID [2022-04-15 06:00:30,104 INFO L272 TraceCheckUtils]: 28: Hoare triple {6890#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6890#false} is VALID [2022-04-15 06:00:30,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {6890#false} ~cond := #in~cond; {6890#false} is VALID [2022-04-15 06:00:30,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {6890#false} assume 0 == ~cond; {6890#false} is VALID [2022-04-15 06:00:30,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {6890#false} assume !false; {6890#false} is VALID [2022-04-15 06:00:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:30,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:30,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104072697] [2022-04-15 06:00:30,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104072697] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:30,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806175479] [2022-04-15 06:00:30,105 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:00:30,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:30,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:30,106 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-15 06:00:30,106 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-15 06:00:30,270 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-15 06:00:30,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:30,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 06:00:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:30,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:30,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {6889#true} call ULTIMATE.init(); {6889#true} is VALID [2022-04-15 06:00:30,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {6889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-15 06:00:30,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-15 06:00:30,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-15 06:00:30,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {6889#true} call #t~ret4 := main(); {6889#true} is VALID [2022-04-15 06:00:30,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {6889#true} ~x~0 := 0; {6894#(= main_~x~0 0)} is VALID [2022-04-15 06:00:30,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {6894#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:30,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:30,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:30,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:30,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:30,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:30,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:30,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:30,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:30,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:30,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:30,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:30,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:30,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:30,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:30,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:30,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:30,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:30,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:30,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:30,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6998#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:00:30,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {6998#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {6890#false} is VALID [2022-04-15 06:00:30,558 INFO L272 TraceCheckUtils]: 28: Hoare triple {6890#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6890#false} is VALID [2022-04-15 06:00:30,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {6890#false} ~cond := #in~cond; {6890#false} is VALID [2022-04-15 06:00:30,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {6890#false} assume 0 == ~cond; {6890#false} is VALID [2022-04-15 06:00:30,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {6890#false} assume !false; {6890#false} is VALID [2022-04-15 06:00:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:30,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:32,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {6890#false} assume !false; {6890#false} is VALID [2022-04-15 06:00:32,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {7017#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6890#false} is VALID [2022-04-15 06:00:32,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {7021#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7017#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:00:32,052 INFO L272 TraceCheckUtils]: 28: Hoare triple {7025#(not (= (mod main_~x~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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7021#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:00:32,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {7029#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {7025#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:00:32,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {7033#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7029#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {7037#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7033#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {7041#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7037#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {7045#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7041#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:00:32,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {7049#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7045#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:00:32,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {7053#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7049#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:00:32,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {7057#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7053#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:00:32,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {7061#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7057#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {7065#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7061#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {7069#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7065#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {7073#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7069#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:00:32,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {7077#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7073#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:00:32,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {7081#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7077#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:00:32,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {7085#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7081#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:00:32,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {7089#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7085#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {7093#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7089#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {7097#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7093#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:00:32,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {7101#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7097#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {7105#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7101#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:00:32,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {7109#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7105#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {7113#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7109#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {6889#true} ~x~0 := 0; {7113#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:32,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {6889#true} call #t~ret4 := main(); {6889#true} is VALID [2022-04-15 06:00:32,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-15 06:00:32,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-15 06:00:32,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {6889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-15 06:00:32,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {6889#true} call ULTIMATE.init(); {6889#true} is VALID [2022-04-15 06:00:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:32,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806175479] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:32,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:32,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 27] total 51 [2022-04-15 06:00:32,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:32,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152901324] [2022-04-15 06:00:32,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152901324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:32,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:32,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 06:00:32,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834236267] [2022-04-15 06:00:32,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:32,102 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 06:00:32,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:32,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:32,123 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-15 06:00:32,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 06:00:32,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:32,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 06:00:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1901, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:00:32,125 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:33,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:33,253 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 06:00:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:00:33,255 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 06:00:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 06:00:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 06:00:33,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-15 06:00:33,286 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-15 06:00:33,287 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:00:33,287 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 06:00:33,290 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1263, Invalid=3993, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 06:00:33,291 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:33,291 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:00:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 06:00:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 06:00:33,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:33,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:33,324 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:33,325 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:33,325 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 06:00:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 06:00:33,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:33,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:33,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:00:33,326 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:00:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:33,327 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 06:00:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 06:00:33,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:33,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:33,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:33,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:33,328 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-15 06:00:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-15 06:00:33,329 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-15 06:00:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:33,329 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-15 06:00:33,329 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:33,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-15 06:00:33,361 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-15 06:00:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 06:00:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:00:33,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:33,361 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:33,368 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-15 06:00:33,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-15 06:00:33,764 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:33,764 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:33,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 43 times [2022-04-15 06:00:33,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:33,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [546002908] [2022-04-15 06:00:34,230 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:34,232 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash -626095561, now seen corresponding path program 1 times [2022-04-15 06:00:34,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:34,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633324523] [2022-04-15 06:00:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:34,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:34,244 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_22.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_22.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:34,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402384628] [2022-04-15 06:00:34,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:34,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:34,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:34,250 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-15 06:00:34,251 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-15 06:00:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:34,294 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:34,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 44 times [2022-04-15 06:00:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:34,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905653107] [2022-04-15 06:00:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:34,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-15 06:00:34,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-15 06:00:34,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-15 06:00:34,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {7392#true} call ULTIMATE.init(); {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:34,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-15 06:00:34,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-15 06:00:34,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-15 06:00:34,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {7392#true} call #t~ret4 := main(); {7392#true} is VALID [2022-04-15 06:00:34,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {7392#true} ~x~0 := 0; {7397#(= main_~x~0 0)} is VALID [2022-04-15 06:00:34,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:34,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:34,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:34,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:34,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:34,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:34,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:34,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:34,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:34,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:34,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:34,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:34,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:34,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:34,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:34,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:34,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:34,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:34,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:34,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:34,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:00:34,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7419#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 44))} is VALID [2022-04-15 06:00:34,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {7419#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 < 268435455); {7393#false} is VALID [2022-04-15 06:00:34,781 INFO L272 TraceCheckUtils]: 29: Hoare triple {7393#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7393#false} is VALID [2022-04-15 06:00:34,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {7393#false} ~cond := #in~cond; {7393#false} is VALID [2022-04-15 06:00:34,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {7393#false} assume 0 == ~cond; {7393#false} is VALID [2022-04-15 06:00:34,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {7393#false} assume !false; {7393#false} is VALID [2022-04-15 06:00:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:34,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:34,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905653107] [2022-04-15 06:00:34,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905653107] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:34,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535059734] [2022-04-15 06:00:34,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:00:34,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:34,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:34,783 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-15 06:00:34,784 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-15 06:00:34,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:00:34,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:34,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 06:00:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:34,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:35,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {7392#true} call ULTIMATE.init(); {7392#true} is VALID [2022-04-15 06:00:35,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {7392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-15 06:00:35,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-15 06:00:35,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-15 06:00:35,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {7392#true} call #t~ret4 := main(); {7392#true} is VALID [2022-04-15 06:00:35,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {7392#true} ~x~0 := 0; {7397#(= main_~x~0 0)} is VALID [2022-04-15 06:00:35,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:35,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:35,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:35,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:35,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:35,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:35,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:35,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:35,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:35,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:35,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:35,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:35,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:35,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:35,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:35,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:35,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:35,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:35,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:35,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:35,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:00:35,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7505#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:00:35,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {7505#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 < 268435455); {7393#false} is VALID [2022-04-15 06:00:35,232 INFO L272 TraceCheckUtils]: 29: Hoare triple {7393#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7393#false} is VALID [2022-04-15 06:00:35,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {7393#false} ~cond := #in~cond; {7393#false} is VALID [2022-04-15 06:00:35,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {7393#false} assume 0 == ~cond; {7393#false} is VALID [2022-04-15 06:00:35,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {7393#false} assume !false; {7393#false} is VALID [2022-04-15 06:00:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:35,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:36,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {7393#false} assume !false; {7393#false} is VALID [2022-04-15 06:00:36,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {7393#false} assume 0 == ~cond; {7393#false} is VALID [2022-04-15 06:00:36,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {7393#false} ~cond := #in~cond; {7393#false} is VALID [2022-04-15 06:00:36,240 INFO L272 TraceCheckUtils]: 29: Hoare triple {7393#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7393#false} is VALID [2022-04-15 06:00:36,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {7533#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {7393#false} is VALID [2022-04-15 06:00:36,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {7537#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7533#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {7541#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7537#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {7545#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7541#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {7549#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7545#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {7553#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7549#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {7557#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7553#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {7561#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7557#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {7565#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7561#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {7569#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7565#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {7573#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7569#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {7577#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7573#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {7581#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7577#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {7585#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7581#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {7589#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7585#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {7593#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7589#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {7597#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7593#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {7601#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7597#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {7605#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7601#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {7609#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7605#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {7613#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7609#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {7617#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7613#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {7621#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7617#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {7392#true} ~x~0 := 0; {7621#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:36,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {7392#true} call #t~ret4 := main(); {7392#true} is VALID [2022-04-15 06:00:36,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-15 06:00:36,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-15 06:00:36,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {7392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-15 06:00:36,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {7392#true} call ULTIMATE.init(); {7392#true} is VALID [2022-04-15 06:00:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:36,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535059734] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:36,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:36,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-15 06:00:36,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:36,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [546002908] [2022-04-15 06:00:36,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [546002908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:36,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:36,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:00:36,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217397437] [2022-04-15 06:00:36,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:36,274 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 06:00:36,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:36,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:36,294 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-15 06:00:36,294 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:00:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:36,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:00:36,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 06:00:36,295 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:37,748 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 06:00:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:00:37,748 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 06:00:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 06:00:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 06:00:37,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-15 06:00:37,776 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-15 06:00:37,777 INFO L225 Difference]: With dead ends: 40 [2022-04-15 06:00:37,777 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:00:37,777 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1337, Invalid=3919, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 06:00:37,778 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:37,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:00:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:00:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 06:00:37,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:37,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:37,809 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:37,809 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:37,809 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 06:00:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 06:00:37,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:37,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:37,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:00:37,810 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:00:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:37,811 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 06:00:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 06:00:37,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:37,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:37,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:37,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-15 06:00:37,812 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-15 06:00:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:37,812 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-15 06:00:37,812 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:37,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-15 06:00:37,855 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-15 06:00:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 06:00:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:00:37,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:37,855 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:37,862 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-15 06:00:38,073 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-15 06:00:38,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45 [2022-04-15 06:00:38,256 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:38,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:38,257 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 45 times [2022-04-15 06:00:38,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:38,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294562116] [2022-04-15 06:00:38,438 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:38,440 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash -566990217, now seen corresponding path program 1 times [2022-04-15 06:00:38,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:38,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709968043] [2022-04-15 06:00:38,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:38,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:38,446 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_23.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_23.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:38,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159667000] [2022-04-15 06:00:38,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:38,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:38,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:38,454 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-15 06:00:38,454 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-15 06:00:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:38,512 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:38,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 46 times [2022-04-15 06:00:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:38,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742485613] [2022-04-15 06:00:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:38,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:39,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {7937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-15 06:00:39,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-15 06:00:39,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-15 06:00:39,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:39,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {7937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-15 06:00:39,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-15 06:00:39,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-15 06:00:39,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {7908#true} call #t~ret4 := main(); {7908#true} is VALID [2022-04-15 06:00:39,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {7908#true} ~x~0 := 0; {7913#(= main_~x~0 0)} is VALID [2022-04-15 06:00:39,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {7913#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:39,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:39,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:39,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:39,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:39,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:39,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:39,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:39,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:39,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:39,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:39,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:39,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:39,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:39,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:39,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:39,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:39,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:39,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:39,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:39,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:00:39,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:00:39,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7936#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 46))} is VALID [2022-04-15 06:00:39,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {7936#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 46))} assume !(~x~0 % 4294967296 < 268435455); {7909#false} is VALID [2022-04-15 06:00:39,046 INFO L272 TraceCheckUtils]: 30: Hoare triple {7909#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7909#false} is VALID [2022-04-15 06:00:39,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {7909#false} ~cond := #in~cond; {7909#false} is VALID [2022-04-15 06:00:39,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {7909#false} assume 0 == ~cond; {7909#false} is VALID [2022-04-15 06:00:39,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2022-04-15 06:00:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:39,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742485613] [2022-04-15 06:00:39,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742485613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:39,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20705470] [2022-04-15 06:00:39,047 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:00:39,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:39,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:39,048 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-15 06:00:39,049 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-15 06:00:39,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:00:39,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:39,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 06:00:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:39,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:39,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7908#true} is VALID [2022-04-15 06:00:39,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {7908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-15 06:00:39,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-15 06:00:39,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-15 06:00:39,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {7908#true} call #t~ret4 := main(); {7908#true} is VALID [2022-04-15 06:00:39,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {7908#true} ~x~0 := 0; {7913#(= main_~x~0 0)} is VALID [2022-04-15 06:00:39,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {7913#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:39,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:39,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:39,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:39,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:39,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:39,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:39,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:39,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:39,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:39,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:39,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:39,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:39,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:39,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:39,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:39,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:39,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:39,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:39,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:39,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:00:39,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:00:39,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8025#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:00:39,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {8025#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !(~x~0 % 4294967296 < 268435455); {7909#false} is VALID [2022-04-15 06:00:39,475 INFO L272 TraceCheckUtils]: 30: Hoare triple {7909#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7909#false} is VALID [2022-04-15 06:00:39,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {7909#false} ~cond := #in~cond; {7909#false} is VALID [2022-04-15 06:00:39,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {7909#false} assume 0 == ~cond; {7909#false} is VALID [2022-04-15 06:00:39,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2022-04-15 06:00:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:39,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:40,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2022-04-15 06:00:40,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {7909#false} assume 0 == ~cond; {7909#false} is VALID [2022-04-15 06:00:40,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {7909#false} ~cond := #in~cond; {7909#false} is VALID [2022-04-15 06:00:40,515 INFO L272 TraceCheckUtils]: 30: Hoare triple {7909#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7909#false} is VALID [2022-04-15 06:00:40,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {8053#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {7909#false} is VALID [2022-04-15 06:00:40,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {8057#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8053#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {8061#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8057#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {8065#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8061#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {8069#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8065#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {8073#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8069#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {8077#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8073#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {8081#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8077#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {8085#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8081#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {8089#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8085#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {8093#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8089#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {8097#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8093#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {8101#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8097#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {8105#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8101#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {8109#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8105#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {8113#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8109#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {8117#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8113#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {8121#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8117#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {8125#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8121#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {8129#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8125#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {8133#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8129#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {8137#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8133#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {8141#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8137#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {8145#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8141#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {7908#true} ~x~0 := 0; {8145#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:00:40,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {7908#true} call #t~ret4 := main(); {7908#true} is VALID [2022-04-15 06:00:40,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-15 06:00:40,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-15 06:00:40,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {7908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-15 06:00:40,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7908#true} is VALID [2022-04-15 06:00:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:40,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20705470] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:40,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:40,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-15 06:00:40,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:40,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294562116] [2022-04-15 06:00:40,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294562116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:40,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:40,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 06:00:40,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647760133] [2022-04-15 06:00:40,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 06:00:40,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:40,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:40,562 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-15 06:00:40,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 06:00:40,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 06:00:40,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 06:00:40,564 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:41,900 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 06:00:41,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:00:41,900 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 06:00:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 06:00:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 06:00:41,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-15 06:00:41,929 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-15 06:00:41,929 INFO L225 Difference]: With dead ends: 41 [2022-04-15 06:00:41,929 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 06:00:41,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1443, Invalid=4257, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 06:00:41,931 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:41,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:00:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 06:00:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 06:00:41,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:41,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:41,965 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:41,965 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:41,966 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 06:00:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 06:00:41,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:41,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:41,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 06:00:41,966 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 06:00:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:41,967 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 06:00:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 06:00:41,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:41,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:41,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:41,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:41,967 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-15 06:00:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-15 06:00:41,968 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-15 06:00:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:41,968 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-15 06:00:41,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:41,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-15 06:00:42,012 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-15 06:00:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 06:00:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:00:42,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:42,012 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:42,020 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-15 06:00:42,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-15 06:00:42,413 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:42,413 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 47 times [2022-04-15 06:00:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:42,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1071503916] [2022-04-15 06:00:42,636 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:42,638 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash -507884873, now seen corresponding path program 1 times [2022-04-15 06:00:42,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:42,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127496292] [2022-04-15 06:00:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:42,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:42,657 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_24.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_24.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 06:00:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:42,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083755930] [2022-04-15 06:00:42,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:42,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:42,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:42,696 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-15 06:00:42,763 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-15 06:00:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:42,955 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:42,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:42,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 48 times [2022-04-15 06:00:42,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:42,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153856344] [2022-04-15 06:00:42,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:42,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:43,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:43,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {8470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-15 06:00:43,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-15 06:00:43,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-15 06:00:43,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {8440#true} call ULTIMATE.init(); {8470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:43,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {8470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-15 06:00:43,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-15 06:00:43,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-15 06:00:43,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {8440#true} call #t~ret4 := main(); {8440#true} is VALID [2022-04-15 06:00:43,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {8440#true} ~x~0 := 0; {8445#(= main_~x~0 0)} is VALID [2022-04-15 06:00:43,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {8445#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:43,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:43,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:43,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:43,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:43,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:43,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:43,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:43,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:43,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:43,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:43,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:43,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:43,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:43,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:43,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:43,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:43,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:43,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:43,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:43,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:00:43,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:00:43,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:00:43,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8469#(and (<= main_~x~0 48) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:00:43,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {8469#(and (<= main_~x~0 48) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {8441#false} is VALID [2022-04-15 06:00:43,901 INFO L272 TraceCheckUtils]: 31: Hoare triple {8441#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8441#false} is VALID [2022-04-15 06:00:43,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {8441#false} ~cond := #in~cond; {8441#false} is VALID [2022-04-15 06:00:43,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {8441#false} assume 0 == ~cond; {8441#false} is VALID [2022-04-15 06:00:43,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {8441#false} assume !false; {8441#false} is VALID [2022-04-15 06:00:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:43,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:43,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153856344] [2022-04-15 06:00:43,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153856344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:43,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681750094] [2022-04-15 06:00:43,902 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:00:43,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:43,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:43,903 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-15 06:00:43,904 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-15 06:00:44,328 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 06:00:44,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:44,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 06:00:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:44,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:44,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {8440#true} call ULTIMATE.init(); {8440#true} is VALID [2022-04-15 06:00:44,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {8440#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-15 06:00:44,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-15 06:00:44,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-15 06:00:44,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {8440#true} call #t~ret4 := main(); {8440#true} is VALID [2022-04-15 06:00:44,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {8440#true} ~x~0 := 0; {8445#(= main_~x~0 0)} is VALID [2022-04-15 06:00:44,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {8445#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:44,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:44,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:44,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:44,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:44,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:44,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:44,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:44,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:44,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:44,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:44,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:44,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:44,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:44,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:44,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:44,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:44,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:44,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:44,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:44,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:00:44,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:00:44,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:00:44,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8561#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:00:44,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {8561#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {8441#false} is VALID [2022-04-15 06:00:44,711 INFO L272 TraceCheckUtils]: 31: Hoare triple {8441#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8441#false} is VALID [2022-04-15 06:00:44,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {8441#false} ~cond := #in~cond; {8441#false} is VALID [2022-04-15 06:00:44,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {8441#false} assume 0 == ~cond; {8441#false} is VALID [2022-04-15 06:00:44,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {8441#false} assume !false; {8441#false} is VALID [2022-04-15 06:00:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:44,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:46,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {8441#false} assume !false; {8441#false} is VALID [2022-04-15 06:00:46,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {8580#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8441#false} is VALID [2022-04-15 06:00:46,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {8584#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8580#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:00:46,881 INFO L272 TraceCheckUtils]: 31: Hoare triple {8588#(not (= (mod main_~x~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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:00:46,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {8592#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {8588#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:00:46,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {8596#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8592#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {8600#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8596#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {8604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8600#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {8608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {8612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {8616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {8620#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {8624#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8620#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {8628#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8624#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {8632#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8628#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {8636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8632#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {8640#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {8644#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8640#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {8648#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8644#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {8652#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8648#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {8656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8652#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {8660#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {8664#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8660#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {8668#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8664#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {8672#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8668#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {8676#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8672#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {8680#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8676#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:00:46,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {8684#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8680#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {8688#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8684#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {8440#true} ~x~0 := 0; {8688#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:00:46,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {8440#true} call #t~ret4 := main(); {8440#true} is VALID [2022-04-15 06:00:46,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-15 06:00:46,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-15 06:00:46,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {8440#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-15 06:00:46,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {8440#true} call ULTIMATE.init(); {8440#true} is VALID [2022-04-15 06:00:46,941 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:46,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681750094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:46,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:46,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 30] total 57 [2022-04-15 06:00:46,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:46,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1071503916] [2022-04-15 06:00:46,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1071503916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:46,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:46,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:00:46,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902759578] [2022-04-15 06:00:46,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:46,942 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 06:00:46,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:46,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:46,991 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-15 06:00:46,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:00:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:46,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:00:46,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2381, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:00:46,992 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:48,869 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 06:00:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:00:48,870 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 06:00:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 06:00:48,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 06:00:48,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-15 06:00:48,908 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-15 06:00:48,909 INFO L225 Difference]: With dead ends: 42 [2022-04-15 06:00:48,909 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 06:00:48,910 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1584, Invalid=5058, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:00:48,911 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:48,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:00:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 06:00:48,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 06:00:48,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:48,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:48,965 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:48,965 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:48,974 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 06:00:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 06:00:48,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:48,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:48,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 06:00:48,974 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 06:00:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:48,975 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 06:00:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 06:00:48,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:48,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:48,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:48,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-15 06:00:48,976 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-15 06:00:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:48,976 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-15 06:00:48,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:48,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-15 06:00:49,011 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-15 06:00:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 06:00:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 06:00:49,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:49,012 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:49,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-15 06:00:49,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-15 06:00:49,413 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2022-04-15 06:00:49,413 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 49 times [2022-04-15 06:00:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:49,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12785340] [2022-04-15 06:00:49,727 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:49,728 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash -448779529, now seen corresponding path program 1 times [2022-04-15 06:00:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:49,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528326846] [2022-04-15 06:00:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:49,738 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_25.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_25.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:49,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1570407473] [2022-04-15 06:00:49,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:49,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:49,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:49,748 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-15 06:00:49,750 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-15 06:00:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:49,827 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:49,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:49,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 50 times [2022-04-15 06:00:49,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:49,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132398094] [2022-04-15 06:00:49,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:49,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:50,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:50,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {9022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-15 06:00:50,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-15 06:00:50,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-15 06:00:50,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {8991#true} call ULTIMATE.init(); {9022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:50,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {9022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-15 06:00:50,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-15 06:00:50,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-15 06:00:50,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {8991#true} call #t~ret4 := main(); {8991#true} is VALID [2022-04-15 06:00:50,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {8991#true} ~x~0 := 0; {8996#(= main_~x~0 0)} is VALID [2022-04-15 06:00:50,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {8996#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:50,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:50,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:50,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:50,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:50,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:50,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:50,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:50,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:50,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:50,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:50,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:50,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:50,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:50,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:50,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:50,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:50,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:50,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:50,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:50,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:00:50,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:00:50,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:00:50,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:00:50,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9021#(and (<= main_~x~0 50) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:00:50,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {9021#(and (<= main_~x~0 50) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {8992#false} is VALID [2022-04-15 06:00:50,453 INFO L272 TraceCheckUtils]: 32: Hoare triple {8992#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8992#false} is VALID [2022-04-15 06:00:50,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {8992#false} ~cond := #in~cond; {8992#false} is VALID [2022-04-15 06:00:50,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {8992#false} assume 0 == ~cond; {8992#false} is VALID [2022-04-15 06:00:50,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {8992#false} assume !false; {8992#false} is VALID [2022-04-15 06:00:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:50,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:50,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132398094] [2022-04-15 06:00:50,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132398094] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:50,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829353380] [2022-04-15 06:00:50,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:00:50,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:50,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:50,456 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-15 06:00:50,457 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-15 06:00:50,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:00:50,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:50,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 06:00:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:50,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:51,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {8991#true} call ULTIMATE.init(); {8991#true} is VALID [2022-04-15 06:00:51,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {8991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-15 06:00:51,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-15 06:00:51,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-15 06:00:51,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {8991#true} call #t~ret4 := main(); {8991#true} is VALID [2022-04-15 06:00:51,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {8991#true} ~x~0 := 0; {8996#(= main_~x~0 0)} is VALID [2022-04-15 06:00:51,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {8996#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:51,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:51,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:51,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:51,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:51,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:51,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:51,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:51,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:51,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:51,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:51,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:51,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:51,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:51,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:51,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:51,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:51,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:51,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:51,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:51,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:00:51,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:00:51,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:00:51,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:00:51,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9116#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:00:51,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {9116#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {8992#false} is VALID [2022-04-15 06:00:51,043 INFO L272 TraceCheckUtils]: 32: Hoare triple {8992#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8992#false} is VALID [2022-04-15 06:00:51,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {8992#false} ~cond := #in~cond; {8992#false} is VALID [2022-04-15 06:00:51,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {8992#false} assume 0 == ~cond; {8992#false} is VALID [2022-04-15 06:00:51,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {8992#false} assume !false; {8992#false} is VALID [2022-04-15 06:00:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:51,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:52,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {8992#false} assume !false; {8992#false} is VALID [2022-04-15 06:00:52,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {8992#false} assume 0 == ~cond; {8992#false} is VALID [2022-04-15 06:00:52,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {8992#false} ~cond := #in~cond; {8992#false} is VALID [2022-04-15 06:00:52,475 INFO L272 TraceCheckUtils]: 32: Hoare triple {8992#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8992#false} is VALID [2022-04-15 06:00:52,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {9144#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {8992#false} is VALID [2022-04-15 06:00:52,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {9148#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9144#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {9152#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9148#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {9156#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9152#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {9160#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9156#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {9164#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9160#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {9168#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9164#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {9172#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9168#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {9176#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9172#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {9180#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9176#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {9184#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9180#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {9188#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9184#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {9192#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9188#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {9196#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9192#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {9200#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9196#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {9204#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9200#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {9208#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9204#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {9212#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9208#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {9216#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9212#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {9220#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9216#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {9224#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9220#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {9228#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9224#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {9232#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9228#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {9236#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9232#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {9240#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9236#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {9244#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9240#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {8991#true} ~x~0 := 0; {9244#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:00:52,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {8991#true} call #t~ret4 := main(); {8991#true} is VALID [2022-04-15 06:00:52,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-15 06:00:52,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-15 06:00:52,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {8991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-15 06:00:52,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {8991#true} call ULTIMATE.init(); {8991#true} is VALID [2022-04-15 06:00:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:52,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829353380] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:52,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:52,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 06:00:52,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:52,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12785340] [2022-04-15 06:00:52,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12785340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:52,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:52,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 06:00:52,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652896183] [2022-04-15 06:00:52,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:52,502 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 06:00:52,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:52,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:52,534 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-15 06:00:52,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 06:00:52,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:52,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 06:00:52,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=2243, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 06:00:52,535 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:54,504 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 06:00:54,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:00:54,504 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 06:00:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 06:00:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 06:00:54,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-15 06:00:54,542 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-15 06:00:54,542 INFO L225 Difference]: With dead ends: 43 [2022-04-15 06:00:54,542 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 06:00:54,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1667, Invalid=4975, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:00:54,544 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:54,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:00:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 06:00:54,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 06:00:54,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:54,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:54,592 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:54,592 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:54,593 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 06:00:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 06:00:54,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:54,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:54,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:00:54,593 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:00:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:54,594 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 06:00:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 06:00:54,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:54,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:54,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:54,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:54,594 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-15 06:00:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-15 06:00:54,595 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-15 06:00:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:54,595 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-15 06:00:54,595 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:54,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-15 06:00:54,630 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-15 06:00:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 06:00:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:00:54,631 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:54,631 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:54,657 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-15 06:00:54,838 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-15 06:00:55,032 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-15 06:00:55,032 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:55,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 51 times [2022-04-15 06:00:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:55,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390206829] [2022-04-15 06:00:57,243 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:57,245 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:00:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash -389674185, now seen corresponding path program 1 times [2022-04-15 06:00:57,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:57,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505862291] [2022-04-15 06:00:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:57,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:57,254 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_26.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_26.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:00:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:00:57,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229235834] [2022-04-15 06:00:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:57,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:57,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:57,282 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-15 06:00:57,284 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-15 06:00:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:57,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:00:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:00:57,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:00:57,417 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 52 times [2022-04-15 06:00:57,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:57,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271681495] [2022-04-15 06:00:57,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:57,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:58,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {9587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-15 06:00:58,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-15 06:00:58,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-15 06:00:58,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {9555#true} call ULTIMATE.init(); {9587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:58,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {9587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-15 06:00:58,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-15 06:00:58,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-15 06:00:58,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {9555#true} call #t~ret4 := main(); {9555#true} is VALID [2022-04-15 06:00:58,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {9555#true} ~x~0 := 0; {9560#(= main_~x~0 0)} is VALID [2022-04-15 06:00:58,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {9560#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:58,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:58,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:58,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:58,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:58,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:58,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:58,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:58,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:58,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:58,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:58,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:58,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:58,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:58,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:58,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:58,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:58,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:58,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:58,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:58,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:00:58,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:00:58,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:00:58,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:00:58,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:00:58,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9586#(and (<= main_~x~0 52) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:00:58,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {9586#(and (<= main_~x~0 52) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {9556#false} is VALID [2022-04-15 06:00:58,148 INFO L272 TraceCheckUtils]: 33: Hoare triple {9556#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {9556#false} is VALID [2022-04-15 06:00:58,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {9556#false} ~cond := #in~cond; {9556#false} is VALID [2022-04-15 06:00:58,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {9556#false} assume 0 == ~cond; {9556#false} is VALID [2022-04-15 06:00:58,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {9556#false} assume !false; {9556#false} is VALID [2022-04-15 06:00:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:58,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271681495] [2022-04-15 06:00:58,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271681495] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:58,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553591346] [2022-04-15 06:00:58,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:00:58,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:58,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:58,152 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-15 06:00:58,153 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-15 06:00:58,227 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:00:58,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:58,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 06:00:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:58,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:58,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {9555#true} call ULTIMATE.init(); {9555#true} is VALID [2022-04-15 06:00:58,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {9555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-15 06:00:58,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-15 06:00:58,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-15 06:00:58,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {9555#true} call #t~ret4 := main(); {9555#true} is VALID [2022-04-15 06:00:58,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {9555#true} ~x~0 := 0; {9560#(= main_~x~0 0)} is VALID [2022-04-15 06:00:58,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {9560#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:00:58,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:00:58,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:00:58,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:00:58,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:00:58,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:00:58,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:00:58,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:00:58,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:00:58,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:00:58,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:00:58,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:00:58,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:00:58,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:00:58,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:00:58,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:00:58,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:00:58,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:00:58,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:00:58,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:00:58,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:00:58,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:00:58,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:00:58,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:00:58,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:00:58,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9684#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:00:58,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {9684#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {9556#false} is VALID [2022-04-15 06:00:58,613 INFO L272 TraceCheckUtils]: 33: Hoare triple {9556#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {9556#false} is VALID [2022-04-15 06:00:58,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {9556#false} ~cond := #in~cond; {9556#false} is VALID [2022-04-15 06:00:58,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {9556#false} assume 0 == ~cond; {9556#false} is VALID [2022-04-15 06:00:58,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {9556#false} assume !false; {9556#false} is VALID [2022-04-15 06:00:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:58,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:59,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {9556#false} assume !false; {9556#false} is VALID [2022-04-15 06:00:59,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {9556#false} assume 0 == ~cond; {9556#false} is VALID [2022-04-15 06:00:59,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {9556#false} ~cond := #in~cond; {9556#false} is VALID [2022-04-15 06:00:59,892 INFO L272 TraceCheckUtils]: 33: Hoare triple {9556#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {9556#false} is VALID [2022-04-15 06:00:59,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {9712#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {9556#false} is VALID [2022-04-15 06:00:59,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {9716#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9712#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {9720#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9716#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {9724#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9720#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {9728#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9724#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {9732#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9728#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {9736#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9732#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {9740#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9736#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {9744#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9740#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {9748#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9744#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {9752#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9748#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {9756#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9752#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {9760#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9756#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {9764#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9760#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {9768#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9764#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {9772#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9768#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {9776#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9772#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {9780#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9776#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {9784#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9780#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {9788#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9784#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {9792#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9788#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {9796#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9792#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {9800#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9796#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {9804#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9800#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {9808#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9804#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {9812#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9808#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {9816#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9812#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {9555#true} ~x~0 := 0; {9816#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:00:59,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {9555#true} call #t~ret4 := main(); {9555#true} is VALID [2022-04-15 06:00:59,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-15 06:00:59,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-15 06:00:59,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {9555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-15 06:00:59,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {9555#true} call ULTIMATE.init(); {9555#true} is VALID [2022-04-15 06:00:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:00:59,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553591346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:59,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:59,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-15 06:00:59,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:59,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390206829] [2022-04-15 06:00:59,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390206829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:59,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:59,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:00:59,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049610538] [2022-04-15 06:00:59,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 06:00:59,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:59,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:00:59,940 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-15 06:00:59,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:00:59,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:59,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:00:59,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=2410, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:00:59,941 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:01,722 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 06:01:01,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:01:01,722 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 06:01:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 06:01:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 06:01:01,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-15 06:01:01,765 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-15 06:01:01,765 INFO L225 Difference]: With dead ends: 44 [2022-04-15 06:01:01,765 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 06:01:01,766 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1785, Invalid=5355, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 06:01:01,767 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:01,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:01:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 06:01:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 06:01:01,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:01,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:01,810 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:01,810 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:01,810 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 06:01:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 06:01:01,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:01,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:01,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 06:01:01,811 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 06:01:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:01,812 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 06:01:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 06:01:01,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:01,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:01,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:01,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-15 06:01:01,813 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-15 06:01:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:01,813 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-15 06:01:01,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:01,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-15 06:01:01,844 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-15 06:01:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 06:01:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 06:01:01,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:01,845 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:01,865 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-15 06:01:02,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-15 06:01:02,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:02,246 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 53 times [2022-04-15 06:01:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:02,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1262448612] [2022-04-15 06:01:04,507 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:04,510 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash -330568841, now seen corresponding path program 1 times [2022-04-15 06:01:04,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:04,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853043742] [2022-04-15 06:01:04,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:04,518 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_27.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_27.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:01:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:04,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [877225143] [2022-04-15 06:01:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:04,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:04,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:04,527 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-15 06:01:04,528 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-15 06:01:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:04,570 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:04,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 54 times [2022-04-15 06:01:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:04,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496995899] [2022-04-15 06:01:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:05,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:05,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {10168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-15 06:01:05,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-15 06:01:05,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-15 06:01:05,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {10135#true} call ULTIMATE.init(); {10168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:05,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {10168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-15 06:01:05,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-15 06:01:05,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-15 06:01:05,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {10135#true} call #t~ret4 := main(); {10135#true} is VALID [2022-04-15 06:01:05,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {10135#true} ~x~0 := 0; {10140#(= main_~x~0 0)} is VALID [2022-04-15 06:01:05,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {10140#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:05,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:05,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:05,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:05,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:05,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:05,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:05,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:05,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:05,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:05,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:05,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:05,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:05,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:05,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:05,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:05,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:05,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:05,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:05,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:05,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:05,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:05,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:05,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:05,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:05,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:05,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10167#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 54))} is VALID [2022-04-15 06:01:05,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {10167#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 54))} assume !(~x~0 % 4294967296 < 268435455); {10136#false} is VALID [2022-04-15 06:01:05,161 INFO L272 TraceCheckUtils]: 34: Hoare triple {10136#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10136#false} is VALID [2022-04-15 06:01:05,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {10136#false} ~cond := #in~cond; {10136#false} is VALID [2022-04-15 06:01:05,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {10136#false} assume 0 == ~cond; {10136#false} is VALID [2022-04-15 06:01:05,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {10136#false} assume !false; {10136#false} is VALID [2022-04-15 06:01:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:05,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:05,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496995899] [2022-04-15 06:01:05,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496995899] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:05,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979353580] [2022-04-15 06:01:05,162 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:05,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:05,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:05,163 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-15 06:01:05,190 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-15 06:01:05,830 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-15 06:01:05,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:05,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 06:01:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:05,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:06,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {10135#true} call ULTIMATE.init(); {10135#true} is VALID [2022-04-15 06:01:06,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {10135#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-15 06:01:06,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-15 06:01:06,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-15 06:01:06,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {10135#true} call #t~ret4 := main(); {10135#true} is VALID [2022-04-15 06:01:06,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {10135#true} ~x~0 := 0; {10140#(= main_~x~0 0)} is VALID [2022-04-15 06:01:06,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {10140#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:06,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:06,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:06,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:06,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:06,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:06,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:06,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:06,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:06,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:06,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:06,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:06,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:06,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:06,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:06,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:06,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:06,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:06,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:06,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:06,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:06,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:06,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:06,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:06,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:06,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:06,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10268#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:01:06,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {10268#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {10136#false} is VALID [2022-04-15 06:01:06,292 INFO L272 TraceCheckUtils]: 34: Hoare triple {10136#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10136#false} is VALID [2022-04-15 06:01:06,292 INFO L290 TraceCheckUtils]: 35: Hoare triple {10136#false} ~cond := #in~cond; {10136#false} is VALID [2022-04-15 06:01:06,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {10136#false} assume 0 == ~cond; {10136#false} is VALID [2022-04-15 06:01:06,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {10136#false} assume !false; {10136#false} is VALID [2022-04-15 06:01:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:06,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:10,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {10136#false} assume !false; {10136#false} is VALID [2022-04-15 06:01:10,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {10136#false} assume 0 == ~cond; {10136#false} is VALID [2022-04-15 06:01:10,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {10136#false} ~cond := #in~cond; {10136#false} is VALID [2022-04-15 06:01:10,771 INFO L272 TraceCheckUtils]: 34: Hoare triple {10136#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10136#false} is VALID [2022-04-15 06:01:10,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {10296#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {10136#false} is VALID [2022-04-15 06:01:10,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {10300#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10296#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:01:10,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {10304#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10300#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {10308#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10304#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {10312#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10308#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {10316#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10312#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {10320#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10316#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {10324#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10320#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {10328#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10324#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {10332#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10328#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {10336#(or (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10332#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-15 06:01:10,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {10340#(or (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10336#(or (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-15 06:01:10,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {10344#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10340#(or (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {10348#(or (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10344#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {10352#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10348#(or (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {10356#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10352#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} is VALID [2022-04-15 06:01:10,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {10360#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10356#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {10364#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10360#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {10368#(or (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10364#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)))} is VALID [2022-04-15 06:01:10,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {10372#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 36) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10368#(or (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-15 06:01:10,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 38) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10372#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 36) 4294967296)))} is VALID [2022-04-15 06:01:10,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {10380#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ 40 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10376#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 38) 4294967296)))} is VALID [2022-04-15 06:01:10,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {10384#(or (<= 268435455 (mod (+ 42 main_~x~0) 4294967296)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10380#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-15 06:01:10,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {10388#(or (<= 268435455 (mod (+ 44 main_~x~0) 4294967296)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10384#(or (<= 268435455 (mod (+ 42 main_~x~0) 4294967296)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {10392#(or (<= 268435455 (mod (+ main_~x~0 46) 4294967296)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10388#(or (<= 268435455 (mod (+ 44 main_~x~0) 4294967296)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {10396#(or (<= 268435455 (mod (+ main_~x~0 48) 4294967296)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10392#(or (<= 268435455 (mod (+ main_~x~0 46) 4294967296)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {10400#(or (<= 268435455 (mod (+ main_~x~0 50) 4294967296)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10396#(or (<= 268435455 (mod (+ main_~x~0 48) 4294967296)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {10404#(or (<= 268435455 (mod (+ main_~x~0 52) 4294967296)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10400#(or (<= 268435455 (mod (+ main_~x~0 50) 4294967296)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {10135#true} ~x~0 := 0; {10404#(or (<= 268435455 (mod (+ main_~x~0 52) 4294967296)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:01:10,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {10135#true} call #t~ret4 := main(); {10135#true} is VALID [2022-04-15 06:01:10,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-15 06:01:10,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-15 06:01:10,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {10135#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-15 06:01:10,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {10135#true} call ULTIMATE.init(); {10135#true} is VALID [2022-04-15 06:01:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:10,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979353580] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:10,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:10,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 06:01:10,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:10,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1262448612] [2022-04-15 06:01:10,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1262448612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:10,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:10,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 06:01:10,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623975349] [2022-04-15 06:01:10,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:10,797 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 06:01:10,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:10,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:10,826 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-15 06:01:10,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 06:01:10,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:10,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 06:01:10,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=957, Invalid=2583, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:01:10,828 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:12,722 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 06:01:12,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:01:12,722 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 06:01:12,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 06:01:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 06:01:12,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-15 06:01:12,760 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-15 06:01:12,761 INFO L225 Difference]: With dead ends: 45 [2022-04-15 06:01:12,761 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 06:01:12,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1907, Invalid=5749, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 06:01:12,767 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:12,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:01:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 06:01:12,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 06:01:12,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:12,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:12,806 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:12,806 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:12,806 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 06:01:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 06:01:12,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:12,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:12,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 06:01:12,807 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 06:01:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:12,807 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 06:01:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 06:01:12,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:12,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:12,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:12,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:12,808 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-15 06:01:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-15 06:01:12,808 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-15 06:01:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:12,809 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-15 06:01:12,809 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:12,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-15 06:01:12,850 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-15 06:01:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 06:01:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 06:01:12,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:12,851 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:12,855 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-15 06:01:13,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:13,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:13,257 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 55 times [2022-04-15 06:01:13,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:13,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [182171918] [2022-04-15 06:01:13,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:13,689 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash -271463497, now seen corresponding path program 1 times [2022-04-15 06:01:13,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:13,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146104904] [2022-04-15 06:01:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:13,699 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_28.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_28.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:01:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:13,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903550482] [2022-04-15 06:01:13,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:13,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:13,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:13,710 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-15 06:01:13,711 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-15 06:01:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:13,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:13,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 56 times [2022-04-15 06:01:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:13,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083970920] [2022-04-15 06:01:13,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:13,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:14,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:14,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {10765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-15 06:01:14,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-15 06:01:14,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-15 06:01:14,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {10731#true} call ULTIMATE.init(); {10765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:14,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {10765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-15 06:01:14,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-15 06:01:14,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-15 06:01:14,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {10731#true} call #t~ret4 := main(); {10731#true} is VALID [2022-04-15 06:01:14,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {10731#true} ~x~0 := 0; {10736#(= main_~x~0 0)} is VALID [2022-04-15 06:01:14,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {10736#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:14,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:14,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:14,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:14,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:14,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:14,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:14,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:14,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:14,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:14,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:14,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:14,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:14,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:14,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:14,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:14,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:14,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:14,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:14,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:14,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:14,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:14,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:14,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:14,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:14,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:14,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:01:14,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10764#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 56))} is VALID [2022-04-15 06:01:14,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {10764#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 56))} assume !(~x~0 % 4294967296 < 268435455); {10732#false} is VALID [2022-04-15 06:01:14,453 INFO L272 TraceCheckUtils]: 35: Hoare triple {10732#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10732#false} is VALID [2022-04-15 06:01:14,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {10732#false} ~cond := #in~cond; {10732#false} is VALID [2022-04-15 06:01:14,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {10732#false} assume 0 == ~cond; {10732#false} is VALID [2022-04-15 06:01:14,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {10732#false} assume !false; {10732#false} is VALID [2022-04-15 06:01:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:14,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:14,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083970920] [2022-04-15 06:01:14,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083970920] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:14,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202843671] [2022-04-15 06:01:14,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:14,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:14,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:14,455 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-15 06:01:14,457 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-15 06:01:14,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:14,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:14,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 06:01:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:14,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:15,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {10731#true} call ULTIMATE.init(); {10731#true} is VALID [2022-04-15 06:01:15,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {10731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-15 06:01:15,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-15 06:01:15,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-15 06:01:15,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {10731#true} call #t~ret4 := main(); {10731#true} is VALID [2022-04-15 06:01:15,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {10731#true} ~x~0 := 0; {10736#(= main_~x~0 0)} is VALID [2022-04-15 06:01:15,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {10736#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:15,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:15,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:15,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:15,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:15,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:15,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:15,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:15,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:15,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:15,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:15,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:15,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:15,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:15,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:15,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:15,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:15,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:15,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:15,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:15,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:15,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:15,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:15,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:15,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:15,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:15,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:01:15,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10868#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:01:15,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {10868#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {10732#false} is VALID [2022-04-15 06:01:15,099 INFO L272 TraceCheckUtils]: 35: Hoare triple {10732#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10732#false} is VALID [2022-04-15 06:01:15,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {10732#false} ~cond := #in~cond; {10732#false} is VALID [2022-04-15 06:01:15,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {10732#false} assume 0 == ~cond; {10732#false} is VALID [2022-04-15 06:01:15,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {10732#false} assume !false; {10732#false} is VALID [2022-04-15 06:01:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:15,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:16,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {10732#false} assume !false; {10732#false} is VALID [2022-04-15 06:01:16,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {10732#false} assume 0 == ~cond; {10732#false} is VALID [2022-04-15 06:01:16,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {10732#false} ~cond := #in~cond; {10732#false} is VALID [2022-04-15 06:01:16,880 INFO L272 TraceCheckUtils]: 35: Hoare triple {10732#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10732#false} is VALID [2022-04-15 06:01:16,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {10896#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {10732#false} is VALID [2022-04-15 06:01:16,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {10900#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10896#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {10904#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10900#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {10908#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10904#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {10912#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10908#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {10916#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10912#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {10920#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10916#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {10924#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10920#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {10928#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10924#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {10932#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10928#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {10936#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10932#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {10940#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10936#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {10944#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10940#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {10948#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10944#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {10952#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10948#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {10956#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10952#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {10960#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10956#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {10964#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10960#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {10968#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10964#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {10972#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10968#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {10976#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10972#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {10980#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10976#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {10984#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10980#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {10988#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10984#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {10992#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10988#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {10996#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10992#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {11000#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10996#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {11004#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11000#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {11008#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11004#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {10731#true} ~x~0 := 0; {11008#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:16,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {10731#true} call #t~ret4 := main(); {10731#true} is VALID [2022-04-15 06:01:16,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-15 06:01:16,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-15 06:01:16,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {10731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-15 06:01:16,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {10731#true} call ULTIMATE.init(); {10731#true} is VALID [2022-04-15 06:01:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:16,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202843671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:16,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:16,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 06:01:16,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:16,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [182171918] [2022-04-15 06:01:16,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [182171918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:16,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:16,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:01:16,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505120] [2022-04-15 06:01:16,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:16,906 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:01:16,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:16,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:16,934 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-15 06:01:16,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:01:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:16,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:01:16,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=2762, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:01:16,936 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:19,445 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 06:01:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 06:01:19,445 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:01:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 06:01:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 06:01:19,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-15 06:01:19,488 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-15 06:01:19,489 INFO L225 Difference]: With dead ends: 46 [2022-04-15 06:01:19,489 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:01:19,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2033, Invalid=6157, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 06:01:19,490 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:19,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:01:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:01:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 06:01:19,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:19,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:19,551 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:19,551 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:19,552 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 06:01:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 06:01:19,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:19,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:19,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:01:19,552 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:01:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:19,553 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 06:01:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 06:01:19,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:19,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:19,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:19,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-15 06:01:19,554 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-15 06:01:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:19,554 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-15 06:01:19,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:19,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-15 06:01:19,594 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-15 06:01:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 06:01:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 06:01:19,595 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:19,595 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:19,622 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-15 06:01:19,802 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-15 06:01:19,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:19,996 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:19,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 57 times [2022-04-15 06:01:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:19,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914076900] [2022-04-15 06:01:20,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:20,203 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash -212358153, now seen corresponding path program 1 times [2022-04-15 06:01:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:20,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624438442] [2022-04-15 06:01:20,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:20,228 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_29.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_29.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:01:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:20,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1183267979] [2022-04-15 06:01:20,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:20,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:20,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:20,246 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:01:20,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-15 06:01:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:20,301 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:20,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:20,317 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 58 times [2022-04-15 06:01:20,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:20,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376974997] [2022-04-15 06:01:20,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:20,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:21,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:21,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {11378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-15 06:01:21,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-15 06:01:21,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-15 06:01:21,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {11343#true} call ULTIMATE.init(); {11378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:21,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {11378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-15 06:01:21,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-15 06:01:21,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-15 06:01:21,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {11343#true} call #t~ret4 := main(); {11343#true} is VALID [2022-04-15 06:01:21,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {11343#true} ~x~0 := 0; {11348#(= main_~x~0 0)} is VALID [2022-04-15 06:01:21,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {11348#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:21,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:21,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:21,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:21,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:21,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:21,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:21,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:21,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:21,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:21,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:21,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:21,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:21,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:21,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:21,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:21,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:21,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:21,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:21,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:21,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:21,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:21,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:21,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:21,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:21,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:21,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:01:21,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:01:21,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11377#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} is VALID [2022-04-15 06:01:21,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {11377#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} assume !(~x~0 % 4294967296 < 268435455); {11344#false} is VALID [2022-04-15 06:01:21,549 INFO L272 TraceCheckUtils]: 36: Hoare triple {11344#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11344#false} is VALID [2022-04-15 06:01:21,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {11344#false} ~cond := #in~cond; {11344#false} is VALID [2022-04-15 06:01:21,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {11344#false} assume 0 == ~cond; {11344#false} is VALID [2022-04-15 06:01:21,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {11344#false} assume !false; {11344#false} is VALID [2022-04-15 06:01:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:21,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376974997] [2022-04-15 06:01:21,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376974997] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:21,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612695164] [2022-04-15 06:01:21,550 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:21,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:21,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:21,553 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:01:21,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-15 06:01:21,687 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:21,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:21,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-15 06:01:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:21,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:22,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {11343#true} call ULTIMATE.init(); {11343#true} is VALID [2022-04-15 06:01:22,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {11343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-15 06:01:22,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-15 06:01:22,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-15 06:01:22,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {11343#true} call #t~ret4 := main(); {11343#true} is VALID [2022-04-15 06:01:22,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {11343#true} ~x~0 := 0; {11348#(= main_~x~0 0)} is VALID [2022-04-15 06:01:22,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {11348#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:22,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:22,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:22,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:22,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:22,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:22,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:22,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:22,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:22,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:22,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:22,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:22,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:22,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:22,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:22,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:22,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:22,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:22,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:22,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:22,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:22,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:22,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:22,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:22,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:22,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:22,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:01:22,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:01:22,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11484#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:01:22,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {11484#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !(~x~0 % 4294967296 < 268435455); {11344#false} is VALID [2022-04-15 06:01:22,270 INFO L272 TraceCheckUtils]: 36: Hoare triple {11344#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11344#false} is VALID [2022-04-15 06:01:22,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {11344#false} ~cond := #in~cond; {11344#false} is VALID [2022-04-15 06:01:22,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {11344#false} assume 0 == ~cond; {11344#false} is VALID [2022-04-15 06:01:22,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {11344#false} assume !false; {11344#false} is VALID [2022-04-15 06:01:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:22,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:24,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {11344#false} assume !false; {11344#false} is VALID [2022-04-15 06:01:24,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {11344#false} assume 0 == ~cond; {11344#false} is VALID [2022-04-15 06:01:24,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {11344#false} ~cond := #in~cond; {11344#false} is VALID [2022-04-15 06:01:24,147 INFO L272 TraceCheckUtils]: 36: Hoare triple {11344#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11344#false} is VALID [2022-04-15 06:01:24,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {11512#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {11344#false} is VALID [2022-04-15 06:01:24,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {11516#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11512#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {11520#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11516#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {11524#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11520#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {11528#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11524#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {11532#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11528#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {11536#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11532#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {11540#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11536#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {11544#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11540#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {11548#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11544#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {11552#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11548#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {11556#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11552#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {11560#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11556#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {11564#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11560#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {11568#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11564#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {11572#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11568#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {11576#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11572#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {11580#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11576#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {11584#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11580#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {11588#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11584#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {11592#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11588#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {11596#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11592#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {11600#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11596#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {11604#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11600#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {11608#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11604#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {11612#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11608#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {11616#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11612#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {11620#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11616#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {11624#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11620#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {11628#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11624#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {11343#true} ~x~0 := 0; {11628#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:01:24,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {11343#true} call #t~ret4 := main(); {11343#true} is VALID [2022-04-15 06:01:24,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-15 06:01:24,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-15 06:01:24,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {11343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-15 06:01:24,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {11343#true} call ULTIMATE.init(); {11343#true} is VALID [2022-04-15 06:01:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:24,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612695164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:24,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:24,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-15 06:01:24,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:24,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914076900] [2022-04-15 06:01:24,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914076900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:24,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:24,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 06:01:24,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66479721] [2022-04-15 06:01:24,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:24,178 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 06:01:24,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:24,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:24,206 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-15 06:01:24,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 06:01:24,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:24,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 06:01:24,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=2947, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:01:24,207 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:27,203 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 06:01:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 06:01:27,203 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 06:01:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 06:01:27,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 06:01:27,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-15 06:01:27,246 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-15 06:01:27,247 INFO L225 Difference]: With dead ends: 47 [2022-04-15 06:01:27,247 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 06:01:27,248 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2163, Invalid=6579, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 06:01:27,248 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:27,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:01:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 06:01:27,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 06:01:27,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:27,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:27,298 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:27,298 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:27,299 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 06:01:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 06:01:27,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:27,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:27,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 06:01:27,299 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 06:01:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:27,300 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 06:01:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 06:01:27,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:27,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:27,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:27,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:27,300 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-15 06:01:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-15 06:01:27,301 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-15 06:01:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:27,301 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-15 06:01:27,301 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:27,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-15 06:01:27,477 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-15 06:01:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 06:01:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:01:27,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:27,478 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:27,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:27,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:27,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2022-04-15 06:01:27,879 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:27,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 59 times [2022-04-15 06:01:27,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:27,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [628075221] [2022-04-15 06:01:28,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:28,416 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash -153252809, now seen corresponding path program 1 times [2022-04-15 06:01:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:28,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405406012] [2022-04-15 06:01:28,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:28,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:28,424 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_30.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_30.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:01:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:28,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120497094] [2022-04-15 06:01:28,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:28,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:28,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:28,443 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:01:28,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-15 06:01:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:28,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:28,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 60 times [2022-04-15 06:01:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:28,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434726330] [2022-04-15 06:01:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:29,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:29,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {12007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-15 06:01:29,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 06:01:29,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-15 06:01:29,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {12007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:29,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {12007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-15 06:01:29,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 06:01:29,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-15 06:01:29,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret4 := main(); {11971#true} is VALID [2022-04-15 06:01:29,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} ~x~0 := 0; {11976#(= main_~x~0 0)} is VALID [2022-04-15 06:01:29,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {11976#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:29,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:29,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:29,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:29,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:29,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:29,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:29,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:29,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:29,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:29,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:29,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:29,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:29,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:29,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:29,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:29,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:29,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:29,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:29,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:29,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:29,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:29,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:29,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:29,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:29,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:29,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:01:29,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:01:29,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:01:29,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12006#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:01:29,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {12006#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {11972#false} is VALID [2022-04-15 06:01:29,336 INFO L272 TraceCheckUtils]: 37: Hoare triple {11972#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11972#false} is VALID [2022-04-15 06:01:29,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-15 06:01:29,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-15 06:01:29,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 06:01:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:29,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434726330] [2022-04-15 06:01:29,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434726330] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:29,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387229471] [2022-04-15 06:01:29,337 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:29,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:29,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:29,340 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:01:29,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-15 06:01:30,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 06:01:30,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:30,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 70 conjunts are in the unsatisfiable core [2022-04-15 06:01:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:30,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:30,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-15 06:01:30,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-15 06:01:30,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 06:01:30,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-15 06:01:30,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret4 := main(); {11971#true} is VALID [2022-04-15 06:01:30,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} ~x~0 := 0; {11976#(= main_~x~0 0)} is VALID [2022-04-15 06:01:30,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {11976#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:30,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:30,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:30,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:30,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:30,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:30,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:30,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:30,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:30,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:30,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:30,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:30,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:30,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:30,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:30,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:30,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:30,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:30,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:30,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:30,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:30,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:30,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:30,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:30,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:30,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:30,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:01:30,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:01:30,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:01:30,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:01:30,651 INFO L290 TraceCheckUtils]: 36: Hoare triple {12116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {11972#false} is VALID [2022-04-15 06:01:30,651 INFO L272 TraceCheckUtils]: 37: Hoare triple {11972#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11972#false} is VALID [2022-04-15 06:01:30,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-15 06:01:30,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-15 06:01:30,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 06:01:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:30,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:40,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 06:01:40,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {12135#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11972#false} is VALID [2022-04-15 06:01:40,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {12139#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12135#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:40,218 INFO L272 TraceCheckUtils]: 37: Hoare triple {12143#(not (= (mod main_~x~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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:01:40,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {12147#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {12143#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:40,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {12151#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12147#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:01:40,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {12155#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (< (mod main_~x~0 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12151#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:01:40,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {12159#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12155#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (< (mod main_~x~0 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:01:40,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {12163#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12159#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {12167#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12163#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 06:01:40,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {12171#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12167#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} is VALID [2022-04-15 06:01:40,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {12175#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12171#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {12179#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12175#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-15 06:01:40,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {12183#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12179#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} is VALID [2022-04-15 06:01:40,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {12187#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12183#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-15 06:01:40,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {12191#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12187#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {12195#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12191#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {12199#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12195#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {12203#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12199#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {12207#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12203#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} is VALID [2022-04-15 06:01:40,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {12211#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12207#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:01:40,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {12215#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12211#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} is VALID [2022-04-15 06:01:40,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {12219#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12215#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:01:40,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {12223#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12219#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {12227#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12223#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} is VALID [2022-04-15 06:01:40,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {12231#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12227#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:01:40,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {12235#(or (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12231#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:01:40,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {12239#(or (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12235#(or (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {12243#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12239#(or (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {12247#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12243#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {12251#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12247#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:01:40,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {12255#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12251#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {12259#(or (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12255#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:01:40,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {12263#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12259#(or (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:01:40,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {12267#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12263#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:01:40,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} ~x~0 := 0; {12267#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:01:40,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret4 := main(); {11971#true} is VALID [2022-04-15 06:01:40,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-15 06:01:40,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 06:01:40,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-15 06:01:40,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-15 06:01:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:40,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387229471] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:40,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:40,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 36] total 69 [2022-04-15 06:01:40,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:40,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [628075221] [2022-04-15 06:01:40,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [628075221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:40,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:40,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 06:01:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860945827] [2022-04-15 06:01:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:40,258 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 06:01:40,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:40,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:40,286 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-15 06:01:40,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 06:01:40,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:40,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 06:01:40,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3503, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 06:01:40,288 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:42,979 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 06:01:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 06:01:42,979 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 06:01:42,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 06:01:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 06:01:42,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-15 06:01:43,019 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-15 06:01:43,019 INFO L225 Difference]: With dead ends: 48 [2022-04-15 06:01:43,019 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 06:01:43,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2334, Invalid=7566, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 06:01:43,021 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:43,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:01:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 06:01:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 06:01:43,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:43,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:43,071 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:43,071 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:43,072 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 06:01:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 06:01:43,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:43,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:43,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 06:01:43,072 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 06:01:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:43,073 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 06:01:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 06:01:43,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:43,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:43,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:43,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-15 06:01:43,074 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-15 06:01:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:43,074 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-15 06:01:43,074 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:43,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-15 06:01:43,136 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-15 06:01:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 06:01:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:01:43,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:43,137 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:43,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:43,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:43,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:43,538 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:43,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 61 times [2022-04-15 06:01:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:43,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1810040347] [2022-04-15 06:01:43,833 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:43,835 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:43,837 INFO L85 PathProgramCache]: Analyzing trace with hash -94147465, now seen corresponding path program 1 times [2022-04-15 06:01:43,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:43,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537808484] [2022-04-15 06:01:43,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:43,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:43,843 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_31.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_31.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:01:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:43,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1743624786] [2022-04-15 06:01:43,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:43,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:43,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:43,860 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:01:43,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-15 06:01:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:43,927 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:43,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 62 times [2022-04-15 06:01:43,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:43,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952884186] [2022-04-15 06:01:43,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:44,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {12655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-15 06:01:44,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-15 06:01:44,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-15 06:01:44,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {12618#true} call ULTIMATE.init(); {12655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:44,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {12655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-15 06:01:44,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-15 06:01:44,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-15 06:01:44,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {12618#true} call #t~ret4 := main(); {12618#true} is VALID [2022-04-15 06:01:44,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {12618#true} ~x~0 := 0; {12623#(= main_~x~0 0)} is VALID [2022-04-15 06:01:44,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {12623#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:44,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:44,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:44,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:44,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:44,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:44,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:44,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:44,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:44,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:44,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:44,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:44,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:44,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:44,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:44,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:44,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:44,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:44,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:44,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:44,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:44,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:44,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:44,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:44,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:44,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:44,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:01:44,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:01:44,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:01:44,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:01:44,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12654#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 62))} is VALID [2022-04-15 06:01:44,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {12654#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 62))} assume !(~x~0 % 4294967296 < 268435455); {12619#false} is VALID [2022-04-15 06:01:44,872 INFO L272 TraceCheckUtils]: 38: Hoare triple {12619#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12619#false} is VALID [2022-04-15 06:01:44,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {12619#false} ~cond := #in~cond; {12619#false} is VALID [2022-04-15 06:01:44,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {12619#false} assume 0 == ~cond; {12619#false} is VALID [2022-04-15 06:01:44,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {12619#false} assume !false; {12619#false} is VALID [2022-04-15 06:01:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:44,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:44,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952884186] [2022-04-15 06:01:44,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952884186] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:44,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625620896] [2022-04-15 06:01:44,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:44,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:44,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:44,874 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:01:44,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-15 06:01:44,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:44,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:44,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-15 06:01:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:44,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:45,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {12618#true} call ULTIMATE.init(); {12618#true} is VALID [2022-04-15 06:01:45,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {12618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-15 06:01:45,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-15 06:01:45,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-15 06:01:45,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {12618#true} call #t~ret4 := main(); {12618#true} is VALID [2022-04-15 06:01:45,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {12618#true} ~x~0 := 0; {12623#(= main_~x~0 0)} is VALID [2022-04-15 06:01:45,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {12623#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:45,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:45,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:45,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:45,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:45,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:45,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:45,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:45,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:45,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:45,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:45,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:45,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:45,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:45,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:45,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:45,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:45,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:45,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:45,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:45,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:45,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:45,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:45,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:45,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:45,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:45,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:01:45,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:01:45,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:01:45,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:01:45,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12767#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:01:45,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {12767#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !(~x~0 % 4294967296 < 268435455); {12619#false} is VALID [2022-04-15 06:01:45,607 INFO L272 TraceCheckUtils]: 38: Hoare triple {12619#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12619#false} is VALID [2022-04-15 06:01:45,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {12619#false} ~cond := #in~cond; {12619#false} is VALID [2022-04-15 06:01:45,607 INFO L290 TraceCheckUtils]: 40: Hoare triple {12619#false} assume 0 == ~cond; {12619#false} is VALID [2022-04-15 06:01:45,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {12619#false} assume !false; {12619#false} is VALID [2022-04-15 06:01:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:45,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:47,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {12619#false} assume !false; {12619#false} is VALID [2022-04-15 06:01:47,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {12619#false} assume 0 == ~cond; {12619#false} is VALID [2022-04-15 06:01:47,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {12619#false} ~cond := #in~cond; {12619#false} is VALID [2022-04-15 06:01:47,706 INFO L272 TraceCheckUtils]: 38: Hoare triple {12619#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12619#false} is VALID [2022-04-15 06:01:47,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {12795#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {12619#false} is VALID [2022-04-15 06:01:47,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {12799#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12795#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {12803#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12799#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {12807#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12803#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {12811#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12807#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {12815#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12811#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {12819#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12815#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {12823#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12819#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {12827#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12823#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {12831#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12827#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {12835#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12831#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {12839#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12835#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {12843#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12839#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {12847#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12843#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {12851#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12847#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {12855#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12851#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {12859#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12855#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {12863#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12859#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {12867#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12863#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {12871#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12867#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {12875#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12871#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {12879#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12875#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {12883#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12879#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {12887#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12883#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {12891#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12887#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {12895#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12891#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {12899#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12895#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {12903#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12899#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {12907#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12903#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {12911#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12907#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {12915#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12911#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {12919#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12915#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {12618#true} ~x~0 := 0; {12919#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:01:47,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {12618#true} call #t~ret4 := main(); {12618#true} is VALID [2022-04-15 06:01:47,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-15 06:01:47,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-15 06:01:47,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {12618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-15 06:01:47,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {12618#true} call ULTIMATE.init(); {12618#true} is VALID [2022-04-15 06:01:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:47,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625620896] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:47,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:47,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-15 06:01:47,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:47,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1810040347] [2022-04-15 06:01:47,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1810040347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:47,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:47,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 06:01:47,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948703826] [2022-04-15 06:01:47,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 06:01:47,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:47,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:47,761 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-15 06:01:47,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 06:01:47,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:47,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 06:01:47,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1221, Invalid=3335, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 06:01:47,763 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:50,587 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 06:01:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:01:50,588 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 06:01:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 06:01:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 06:01:50,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 49 transitions. [2022-04-15 06:01:50,628 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-15 06:01:50,629 INFO L225 Difference]: With dead ends: 49 [2022-04-15 06:01:50,629 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 06:01:50,630 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2435, Invalid=7465, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 06:01:50,630 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:50,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 158 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:01:50,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 06:01:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 06:01:50,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:50,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:50,680 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:50,680 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:50,681 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 06:01:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 06:01:50,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:50,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:50,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 06:01:50,682 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 06:01:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:50,682 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 06:01:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 06:01:50,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:50,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:50,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:50,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:50,683 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-15 06:01:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-15 06:01:50,683 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-15 06:01:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:50,684 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-15 06:01:50,684 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:50,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-15 06:01:50,724 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-15 06:01:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 06:01:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 06:01:50,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:50,725 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:50,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:50,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:51,125 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:51,126 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:51,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 63 times [2022-04-15 06:01:51,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:51,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [549383386] [2022-04-15 06:01:51,350 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:51,352 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:51,355 INFO L85 PathProgramCache]: Analyzing trace with hash -35042121, now seen corresponding path program 1 times [2022-04-15 06:01:51,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:51,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921250841] [2022-04-15 06:01:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:51,361 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_32.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_32.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:01:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:51,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632726879] [2022-04-15 06:01:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:51,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:51,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:51,376 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:01:51,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-15 06:01:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:51,438 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:51,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:51,459 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 64 times [2022-04-15 06:01:51,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:51,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602625299] [2022-04-15 06:01:51,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:51,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:52,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:52,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {13316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-15 06:01:52,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-15 06:01:52,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-15 06:01:52,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {13278#true} call ULTIMATE.init(); {13316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:52,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {13316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-15 06:01:52,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-15 06:01:52,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-15 06:01:52,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {13278#true} call #t~ret4 := main(); {13278#true} is VALID [2022-04-15 06:01:52,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {13278#true} ~x~0 := 0; {13283#(= main_~x~0 0)} is VALID [2022-04-15 06:01:52,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {13283#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:52,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:52,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:52,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:52,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:52,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:52,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:52,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:52,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:52,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:52,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:52,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:52,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:52,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:52,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:52,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:52,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:52,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:52,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:52,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:52,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:52,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:52,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:52,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:52,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:52,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:52,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:01:52,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:01:52,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:01:52,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:01:52,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:01:52,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13315#(and (<= main_~x~0 64) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:01:52,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {13315#(and (<= main_~x~0 64) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {13279#false} is VALID [2022-04-15 06:01:52,335 INFO L272 TraceCheckUtils]: 39: Hoare triple {13279#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13279#false} is VALID [2022-04-15 06:01:52,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {13279#false} ~cond := #in~cond; {13279#false} is VALID [2022-04-15 06:01:52,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {13279#false} assume 0 == ~cond; {13279#false} is VALID [2022-04-15 06:01:52,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {13279#false} assume !false; {13279#false} is VALID [2022-04-15 06:01:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:52,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:52,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602625299] [2022-04-15 06:01:52,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602625299] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:52,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986148010] [2022-04-15 06:01:52,336 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:52,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:52,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:52,338 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:01:52,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-15 06:01:52,455 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:52,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:52,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-15 06:01:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:52,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:53,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {13278#true} call ULTIMATE.init(); {13278#true} is VALID [2022-04-15 06:01:53,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {13278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-15 06:01:53,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-15 06:01:53,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-15 06:01:53,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {13278#true} call #t~ret4 := main(); {13278#true} is VALID [2022-04-15 06:01:53,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {13278#true} ~x~0 := 0; {13283#(= main_~x~0 0)} is VALID [2022-04-15 06:01:53,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {13283#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:01:53,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:01:53,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:01:53,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:01:53,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:01:53,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:01:53,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:01:53,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:01:53,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:01:53,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:01:53,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:01:53,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:01:53,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:01:53,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:01:53,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:01:53,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:01:53,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:01:53,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:01:53,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:01:53,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:01:53,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:01:53,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:01:53,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:01:53,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:01:53,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:01:53,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:01:53,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:01:53,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:01:53,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:01:53,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:01:53,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:01:53,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13431#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:01:53,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {13431#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {13279#false} is VALID [2022-04-15 06:01:53,096 INFO L272 TraceCheckUtils]: 39: Hoare triple {13279#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13279#false} is VALID [2022-04-15 06:01:53,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {13279#false} ~cond := #in~cond; {13279#false} is VALID [2022-04-15 06:01:53,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {13279#false} assume 0 == ~cond; {13279#false} is VALID [2022-04-15 06:01:53,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {13279#false} assume !false; {13279#false} is VALID [2022-04-15 06:01:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:53,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:55,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {13279#false} assume !false; {13279#false} is VALID [2022-04-15 06:01:55,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {13279#false} assume 0 == ~cond; {13279#false} is VALID [2022-04-15 06:01:55,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {13279#false} ~cond := #in~cond; {13279#false} is VALID [2022-04-15 06:01:55,289 INFO L272 TraceCheckUtils]: 39: Hoare triple {13279#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13279#false} is VALID [2022-04-15 06:01:55,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {13459#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {13279#false} is VALID [2022-04-15 06:01:55,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {13463#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13459#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {13467#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13463#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {13471#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13467#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {13475#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13471#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {13479#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13475#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {13483#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13479#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {13487#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13483#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {13491#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13487#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {13495#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13491#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {13499#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13495#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {13503#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13499#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {13507#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13503#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {13511#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13507#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {13515#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13511#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {13519#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13515#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {13523#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13519#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {13527#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13523#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {13531#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13527#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {13535#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13531#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {13539#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13535#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {13543#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13539#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {13547#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13543#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {13551#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13547#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {13555#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13551#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {13559#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13555#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {13563#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13559#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {13567#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13563#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {13571#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13567#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {13575#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13571#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {13579#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13575#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {13583#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13579#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {13587#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13583#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {13278#true} ~x~0 := 0; {13587#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:01:55,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {13278#true} call #t~ret4 := main(); {13278#true} is VALID [2022-04-15 06:01:55,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-15 06:01:55,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-15 06:01:55,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {13278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-15 06:01:55,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {13278#true} call ULTIMATE.init(); {13278#true} is VALID [2022-04-15 06:01:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:55,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986148010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:55,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:55,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-15 06:01:55,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:55,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [549383386] [2022-04-15 06:01:55,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [549383386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:55,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:55,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 06:01:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139903522] [2022-04-15 06:01:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:55,321 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 06:01:55,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:55,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:55,354 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-15 06:01:55,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 06:01:55,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:55,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 06:01:55,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1292, Invalid=3538, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 06:01:55,355 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:58,227 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 06:01:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 06:01:58,228 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 06:01:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 06:01:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 06:01:58,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-15 06:01:58,299 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-15 06:01:58,300 INFO L225 Difference]: With dead ends: 50 [2022-04-15 06:01:58,300 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 06:01:58,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2577, Invalid=7929, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 06:01:58,301 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:58,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:01:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 06:01:58,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 06:01:58,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:58,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:58,352 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:58,353 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:58,364 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 06:01:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 06:01:58,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:58,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:58,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:01:58,364 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:01:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:58,365 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 06:01:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 06:01:58,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:58,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:58,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:58,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-15 06:01:58,366 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-15 06:01:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:58,366 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-15 06:01:58,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:01:58,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-15 06:01:58,417 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-15 06:01:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 06:01:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:01:58,418 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:58,418 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:58,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:58,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:58,818 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:58,819 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:58,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:58,819 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 65 times [2022-04-15 06:01:58,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:58,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006821233] [2022-04-15 06:01:59,106 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:59,108 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:59,111 INFO L85 PathProgramCache]: Analyzing trace with hash 24063223, now seen corresponding path program 1 times [2022-04-15 06:01:59,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:59,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249909238] [2022-04-15 06:01:59,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:59,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:59,116 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_33.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_33.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:01:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:59,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974268437] [2022-04-15 06:01:59,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:59,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:59,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:59,122 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:01:59,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-15 06:01:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:59,189 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:59,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 66 times [2022-04-15 06:01:59,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:59,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573965043] [2022-04-15 06:01:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:00,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:00,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {13993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-15 06:02:00,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-15 06:02:00,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-15 06:02:00,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {13954#true} call ULTIMATE.init(); {13993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:00,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {13993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-15 06:02:00,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-15 06:02:00,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-15 06:02:00,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {13954#true} call #t~ret4 := main(); {13954#true} is VALID [2022-04-15 06:02:00,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {13954#true} ~x~0 := 0; {13959#(= main_~x~0 0)} is VALID [2022-04-15 06:02:00,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {13959#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:00,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:00,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:00,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:00,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:00,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:00,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:00,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:00,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:00,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:00,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:00,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:00,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:00,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:00,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:00,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:00,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:00,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:00,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:00,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:00,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:00,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:00,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:00,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:00,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:00,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:00,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:00,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:00,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:00,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:00,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:00,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:00,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13992#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:00,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {13992#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 66))} assume !(~x~0 % 4294967296 < 268435455); {13955#false} is VALID [2022-04-15 06:02:00,135 INFO L272 TraceCheckUtils]: 40: Hoare triple {13955#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13955#false} is VALID [2022-04-15 06:02:00,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {13955#false} ~cond := #in~cond; {13955#false} is VALID [2022-04-15 06:02:00,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {13955#false} assume 0 == ~cond; {13955#false} is VALID [2022-04-15 06:02:00,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {13955#false} assume !false; {13955#false} is VALID [2022-04-15 06:02:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:00,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573965043] [2022-04-15 06:02:00,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573965043] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:00,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294965008] [2022-04-15 06:02:00,136 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:02:00,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:00,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:00,138 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:02:00,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-15 06:02:01,829 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-15 06:02:01,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:01,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-15 06:02:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:01,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:02,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {13954#true} call ULTIMATE.init(); {13954#true} is VALID [2022-04-15 06:02:02,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {13954#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-15 06:02:02,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-15 06:02:02,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-15 06:02:02,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {13954#true} call #t~ret4 := main(); {13954#true} is VALID [2022-04-15 06:02:02,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {13954#true} ~x~0 := 0; {13959#(= main_~x~0 0)} is VALID [2022-04-15 06:02:02,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {13959#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:02,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:02,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:02,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:02,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:02,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:02,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:02,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:02,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:02,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:02,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:02,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:02,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:02,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:02,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:02,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:02,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:02,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:02,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:02,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:02,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:02,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:02,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:02,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:02,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:02,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:02,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:02,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:02,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:02,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:02,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:02,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:02,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14111#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:02,346 INFO L290 TraceCheckUtils]: 39: Hoare triple {14111#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !(~x~0 % 4294967296 < 268435455); {13955#false} is VALID [2022-04-15 06:02:02,346 INFO L272 TraceCheckUtils]: 40: Hoare triple {13955#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13955#false} is VALID [2022-04-15 06:02:02,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {13955#false} ~cond := #in~cond; {13955#false} is VALID [2022-04-15 06:02:02,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {13955#false} assume 0 == ~cond; {13955#false} is VALID [2022-04-15 06:02:02,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {13955#false} assume !false; {13955#false} is VALID [2022-04-15 06:02:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:02,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:05,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {13955#false} assume !false; {13955#false} is VALID [2022-04-15 06:02:05,644 INFO L290 TraceCheckUtils]: 42: Hoare triple {14130#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13955#false} is VALID [2022-04-15 06:02:05,644 INFO L290 TraceCheckUtils]: 41: Hoare triple {14134#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14130#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:02:05,645 INFO L272 TraceCheckUtils]: 40: Hoare triple {14138#(< 0 (mod 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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14134#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:02:05,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {14142#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {14138#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 06:02:05,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {14146#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14142#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {14150#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14146#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {14154#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14150#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {14158#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14154#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {14162#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14158#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {14166#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14162#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {14170#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14166#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {14174#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14170#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {14178#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14174#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {14182#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14178#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {14186#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14182#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {14190#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14186#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {14194#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14190#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {14198#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14194#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {14202#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14198#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {14206#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14202#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {14210#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14206#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {14214#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14210#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {14218#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14214#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {14222#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14218#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {14226#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14222#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} is VALID [2022-04-15 06:02:05,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {14230#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14226#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {14234#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14230#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {14238#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14234#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {14242#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14238#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {14246#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14242#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {14250#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14246#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {14254#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14250#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {14258#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14254#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {14262#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14258#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {14266#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14262#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {14270#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14266#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {14274#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14270#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {13954#true} ~x~0 := 0; {14274#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:05,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {13954#true} call #t~ret4 := main(); {13954#true} is VALID [2022-04-15 06:02:05,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-15 06:02:05,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-15 06:02:05,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {13954#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-15 06:02:05,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {13954#true} call ULTIMATE.init(); {13954#true} is VALID [2022-04-15 06:02:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:05,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294965008] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:05,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:05,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 39] total 75 [2022-04-15 06:02:05,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:05,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006821233] [2022-04-15 06:02:05,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006821233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:05,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:05,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 06:02:05,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816845872] [2022-04-15 06:02:05,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:05,754 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 06:02:05,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:05,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:05,789 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-15 06:02:05,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 06:02:05,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:05,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 06:02:05,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=4145, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 06:02:05,791 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:08,448 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 06:02:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 06:02:08,448 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 06:02:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 06:02:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 06:02:08,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-15 06:02:08,498 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-15 06:02:08,499 INFO L225 Difference]: With dead ends: 51 [2022-04-15 06:02:08,499 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 06:02:08,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2763, Invalid=9009, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 06:02:08,504 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:08,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:02:08,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 06:02:08,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 06:02:08,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:08,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:08,561 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:08,561 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:08,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:08,562 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 06:02:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 06:02:08,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:08,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:08,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 06:02:08,562 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 06:02:08,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:08,563 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 06:02:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 06:02:08,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:08,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:08,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:08,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:08,566 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-15 06:02:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-15 06:02:08,566 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-15 06:02:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:08,566 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-15 06:02:08,567 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:08,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-15 06:02:08,613 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-15 06:02:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 06:02:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 06:02:08,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:08,614 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:08,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:08,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-04-15 06:02:09,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67 [2022-04-15 06:02:09,015 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:09,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:09,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 67 times [2022-04-15 06:02:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:09,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [824231186] [2022-04-15 06:02:09,168 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:02:09,170 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash 83168567, now seen corresponding path program 1 times [2022-04-15 06:02:09,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:09,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343575428] [2022-04-15 06:02:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:09,176 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_34.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_34.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:02:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:09,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524305518] [2022-04-15 06:02:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:09,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:09,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:09,181 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:02:09,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-15 06:02:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:09,232 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:09,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 68 times [2022-04-15 06:02:09,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:09,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364036212] [2022-04-15 06:02:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:10,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:10,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {14689#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-15 06:02:10,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-15 06:02:10,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-15 06:02:10,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {14649#true} call ULTIMATE.init(); {14689#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:10,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {14689#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-15 06:02:10,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-15 06:02:10,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-15 06:02:10,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {14649#true} call #t~ret4 := main(); {14649#true} is VALID [2022-04-15 06:02:10,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {14649#true} ~x~0 := 0; {14654#(= main_~x~0 0)} is VALID [2022-04-15 06:02:10,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {14654#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:10,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:10,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:10,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:10,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:10,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:10,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:10,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:10,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:10,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:10,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:10,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:10,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:10,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:10,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:10,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:10,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:10,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:10,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:10,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:10,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:10,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:10,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:10,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:10,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:10,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:10,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:10,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:10,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:10,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:10,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:10,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:10,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:10,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14688#(and (<= main_~x~0 68) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:02:10,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {14688#(and (<= main_~x~0 68) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {14650#false} is VALID [2022-04-15 06:02:10,714 INFO L272 TraceCheckUtils]: 41: Hoare triple {14650#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14650#false} is VALID [2022-04-15 06:02:10,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {14650#false} ~cond := #in~cond; {14650#false} is VALID [2022-04-15 06:02:10,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {14650#false} assume 0 == ~cond; {14650#false} is VALID [2022-04-15 06:02:10,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {14650#false} assume !false; {14650#false} is VALID [2022-04-15 06:02:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:10,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364036212] [2022-04-15 06:02:10,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364036212] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:10,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651116181] [2022-04-15 06:02:10,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:02:10,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:10,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:10,720 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:02:10,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-15 06:02:10,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:02:10,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:10,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-15 06:02:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:10,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:11,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {14649#true} call ULTIMATE.init(); {14649#true} is VALID [2022-04-15 06:02:11,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {14649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-15 06:02:11,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-15 06:02:11,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-15 06:02:11,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {14649#true} call #t~ret4 := main(); {14649#true} is VALID [2022-04-15 06:02:11,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {14649#true} ~x~0 := 0; {14654#(= main_~x~0 0)} is VALID [2022-04-15 06:02:11,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {14654#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:11,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:11,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:11,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:11,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:11,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:11,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:11,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:11,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:11,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:11,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:11,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:11,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:11,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:11,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:11,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:11,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:11,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:11,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:11,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:11,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:11,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:11,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:11,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:11,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:11,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:11,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:11,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:11,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:11,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:11,651 INFO L290 TraceCheckUtils]: 36: Hoare triple {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:11,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:11,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:11,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14810#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:02:11,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {14810#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {14650#false} is VALID [2022-04-15 06:02:11,654 INFO L272 TraceCheckUtils]: 41: Hoare triple {14650#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14650#false} is VALID [2022-04-15 06:02:11,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {14650#false} ~cond := #in~cond; {14650#false} is VALID [2022-04-15 06:02:11,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {14650#false} assume 0 == ~cond; {14650#false} is VALID [2022-04-15 06:02:11,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {14650#false} assume !false; {14650#false} is VALID [2022-04-15 06:02:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:11,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:14,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {14650#false} assume !false; {14650#false} is VALID [2022-04-15 06:02:14,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {14650#false} assume 0 == ~cond; {14650#false} is VALID [2022-04-15 06:02:14,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {14650#false} ~cond := #in~cond; {14650#false} is VALID [2022-04-15 06:02:14,120 INFO L272 TraceCheckUtils]: 41: Hoare triple {14650#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14650#false} is VALID [2022-04-15 06:02:14,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {14838#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {14650#false} is VALID [2022-04-15 06:02:14,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {14842#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14838#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {14846#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14842#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {14850#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14846#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {14854#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14850#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {14858#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14854#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {14862#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14858#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {14866#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14862#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {14870#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14866#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {14874#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14870#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {14878#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14874#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {14882#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14878#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {14886#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14882#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {14890#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14886#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {14894#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14890#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {14898#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14894#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {14902#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14898#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {14906#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14902#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {14910#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14906#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {14914#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14910#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {14918#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14914#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {14922#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14918#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {14926#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14922#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {14930#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14926#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {14934#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14930#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {14938#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14934#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {14942#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14938#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {14946#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14942#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {14950#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14946#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {14954#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14950#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {14958#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14954#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {14962#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14958#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {14966#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14962#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {14970#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14966#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {14974#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14970#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {14649#true} ~x~0 := 0; {14974#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:14,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {14649#true} call #t~ret4 := main(); {14649#true} is VALID [2022-04-15 06:02:14,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-15 06:02:14,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-15 06:02:14,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {14649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-15 06:02:14,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {14649#true} call ULTIMATE.init(); {14649#true} is VALID [2022-04-15 06:02:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:14,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651116181] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:14,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:14,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-15 06:02:14,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:14,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [824231186] [2022-04-15 06:02:14,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [824231186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:14,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:14,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 06:02:14,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978122806] [2022-04-15 06:02:14,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 06:02:14,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:14,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:14,202 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-15 06:02:14,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 06:02:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 06:02:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1440, Invalid=3962, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 06:02:14,203 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:17,387 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 06:02:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 06:02:17,387 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 06:02:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 06:02:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 06:02:17,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-15 06:02:17,443 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-15 06:02:17,444 INFO L225 Difference]: With dead ends: 52 [2022-04-15 06:02:17,444 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 06:02:17,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2873, Invalid=8899, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 06:02:17,445 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:17,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:02:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 06:02:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 06:02:17,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:17,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:17,508 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:17,508 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:17,509 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 06:02:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 06:02:17,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:17,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:17,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 06:02:17,509 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 06:02:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:17,510 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 06:02:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 06:02:17,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:17,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:17,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:17,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-15 06:02:17,511 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-15 06:02:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:17,511 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-15 06:02:17,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:17,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-15 06:02:17,566 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-15 06:02:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 06:02:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 06:02:17,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:17,566 INFO L499 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:17,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:17,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:17,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2022-04-15 06:02:17,967 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 69 times [2022-04-15 06:02:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:17,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1954266165] [2022-04-15 06:02:18,304 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:02:18,306 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash 142273911, now seen corresponding path program 1 times [2022-04-15 06:02:18,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:18,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465553542] [2022-04-15 06:02:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:18,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:18,314 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_35.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_35.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:02:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:18,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930555773] [2022-04-15 06:02:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:18,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:18,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:18,319 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:02:18,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-15 06:02:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:18,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:18,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:18,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 70 times [2022-04-15 06:02:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:18,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406470333] [2022-04-15 06:02:18,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:18,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:19,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:19,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {15398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-15 06:02:19,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-15 06:02:19,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-15 06:02:19,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {15357#true} call ULTIMATE.init(); {15398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:19,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {15398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-15 06:02:19,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-15 06:02:19,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-15 06:02:19,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {15357#true} call #t~ret4 := main(); {15357#true} is VALID [2022-04-15 06:02:19,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {15357#true} ~x~0 := 0; {15362#(= main_~x~0 0)} is VALID [2022-04-15 06:02:19,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {15362#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:19,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:19,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:19,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:19,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:19,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:19,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:19,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:19,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:19,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:19,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:19,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:19,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:19,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:19,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:19,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:19,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:19,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:19,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:19,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:19,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:19,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:19,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:19,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:19,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:19,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:19,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:19,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:19,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:19,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:19,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:19,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:19,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:19,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:02:19,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15397#(and (<= main_~x~0 70) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:02:19,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {15397#(and (<= main_~x~0 70) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {15358#false} is VALID [2022-04-15 06:02:19,595 INFO L272 TraceCheckUtils]: 42: Hoare triple {15358#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {15358#false} is VALID [2022-04-15 06:02:19,595 INFO L290 TraceCheckUtils]: 43: Hoare triple {15358#false} ~cond := #in~cond; {15358#false} is VALID [2022-04-15 06:02:19,595 INFO L290 TraceCheckUtils]: 44: Hoare triple {15358#false} assume 0 == ~cond; {15358#false} is VALID [2022-04-15 06:02:19,595 INFO L290 TraceCheckUtils]: 45: Hoare triple {15358#false} assume !false; {15358#false} is VALID [2022-04-15 06:02:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:19,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:19,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406470333] [2022-04-15 06:02:19,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406470333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:19,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146257836] [2022-04-15 06:02:19,596 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:02:19,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:19,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:19,597 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:02:19,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-15 06:02:19,731 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:02:19,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:19,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-15 06:02:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:19,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:20,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {15357#true} call ULTIMATE.init(); {15357#true} is VALID [2022-04-15 06:02:20,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {15357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-15 06:02:20,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-15 06:02:20,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-15 06:02:20,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {15357#true} call #t~ret4 := main(); {15357#true} is VALID [2022-04-15 06:02:20,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {15357#true} ~x~0 := 0; {15362#(= main_~x~0 0)} is VALID [2022-04-15 06:02:20,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {15362#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:20,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:20,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:20,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:20,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:20,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:20,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:20,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:20,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:20,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:20,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:20,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:20,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:20,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:20,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:20,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:20,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:20,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:20,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:20,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:20,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:20,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:20,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:20,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:20,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:20,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:20,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:20,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:20,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:20,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:20,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:20,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:20,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:20,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:02:20,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15522#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:02:20,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {15522#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {15358#false} is VALID [2022-04-15 06:02:20,420 INFO L272 TraceCheckUtils]: 42: Hoare triple {15358#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {15358#false} is VALID [2022-04-15 06:02:20,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {15358#false} ~cond := #in~cond; {15358#false} is VALID [2022-04-15 06:02:20,420 INFO L290 TraceCheckUtils]: 44: Hoare triple {15358#false} assume 0 == ~cond; {15358#false} is VALID [2022-04-15 06:02:20,420 INFO L290 TraceCheckUtils]: 45: Hoare triple {15358#false} assume !false; {15358#false} is VALID [2022-04-15 06:02:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:20,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:22,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {15358#false} assume !false; {15358#false} is VALID [2022-04-15 06:02:22,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {15358#false} assume 0 == ~cond; {15358#false} is VALID [2022-04-15 06:02:22,942 INFO L290 TraceCheckUtils]: 43: Hoare triple {15358#false} ~cond := #in~cond; {15358#false} is VALID [2022-04-15 06:02:22,942 INFO L272 TraceCheckUtils]: 42: Hoare triple {15358#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {15358#false} is VALID [2022-04-15 06:02:22,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {15550#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {15358#false} is VALID [2022-04-15 06:02:22,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {15554#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15550#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {15558#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15554#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {15562#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15558#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {15566#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15562#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {15570#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15566#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {15574#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15570#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {15578#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15574#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {15582#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15578#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {15586#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15582#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {15590#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15586#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {15594#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15590#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {15598#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15594#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {15602#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15598#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {15606#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15602#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {15610#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15606#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {15614#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15610#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {15618#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15614#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {15622#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15618#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {15626#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15622#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {15630#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15626#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {15634#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15630#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {15638#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15634#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {15642#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15638#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {15646#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15642#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {15650#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15646#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {15654#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15650#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {15658#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15654#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {15662#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15658#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {15666#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15662#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {15670#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15666#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {15674#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15670#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {15678#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15674#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {15682#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15678#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {15686#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15682#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {15690#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15686#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {15357#true} ~x~0 := 0; {15690#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:02:22,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {15357#true} call #t~ret4 := main(); {15357#true} is VALID [2022-04-15 06:02:22,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-15 06:02:22,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-15 06:02:22,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {15357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-15 06:02:22,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {15357#true} call ULTIMATE.init(); {15357#true} is VALID [2022-04-15 06:02:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:22,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146257836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:22,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:22,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-15 06:02:22,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:22,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1954266165] [2022-04-15 06:02:22,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1954266165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:22,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:22,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 06:02:22,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664190526] [2022-04-15 06:02:22,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:22,973 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 06:02:22,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:22,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:23,005 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-15 06:02:23,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 06:02:23,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:23,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 06:02:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1517, Invalid=4183, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 06:02:23,007 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:26,448 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 06:02:26,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 06:02:26,448 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 06:02:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 06:02:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 06:02:26,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-15 06:02:26,491 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-15 06:02:26,492 INFO L225 Difference]: With dead ends: 53 [2022-04-15 06:02:26,492 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 06:02:26,493 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3027, Invalid=9405, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 06:02:26,494 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:26,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 06:02:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 06:02:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 06:02:26,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:26,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:26,566 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:26,566 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:26,567 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 06:02:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 06:02:26,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:26,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:26,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 06:02:26,568 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 06:02:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:26,568 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 06:02:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 06:02:26,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:26,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:26,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:26,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:26,569 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-15 06:02:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-15 06:02:26,569 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-15 06:02:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:26,570 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-15 06:02:26,570 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:26,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-15 06:02:26,644 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-15 06:02:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 06:02:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 06:02:26,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:26,645 INFO L499 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:26,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:26,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:27,045 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:27,046 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 71 times [2022-04-15 06:02:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:27,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [447949038] [2022-04-15 06:02:27,753 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:02:27,755 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash 201379255, now seen corresponding path program 1 times [2022-04-15 06:02:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:27,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022689130] [2022-04-15 06:02:27,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:27,764 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_36.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_36.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:02:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:27,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398834386] [2022-04-15 06:02:27,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:27,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:27,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:27,770 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:02:27,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-15 06:02:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:27,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:27,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:27,849 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 72 times [2022-04-15 06:02:27,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:27,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54716925] [2022-04-15 06:02:27,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:29,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:29,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {16123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-15 06:02:29,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-15 06:02:29,286 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-15 06:02:29,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {16081#true} call ULTIMATE.init(); {16123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:29,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {16123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-15 06:02:29,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-15 06:02:29,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-15 06:02:29,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {16081#true} call #t~ret4 := main(); {16081#true} is VALID [2022-04-15 06:02:29,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {16081#true} ~x~0 := 0; {16086#(= main_~x~0 0)} is VALID [2022-04-15 06:02:29,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {16086#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:29,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:29,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:29,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:29,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:29,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:29,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:29,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:29,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:29,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:29,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:29,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:29,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:29,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:29,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:29,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:29,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:29,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:29,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:29,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:29,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:29,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:29,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:29,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:29,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:29,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:29,304 INFO L290 TraceCheckUtils]: 32: Hoare triple {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:29,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:29,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:29,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:29,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:29,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:29,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:29,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:02:29,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:02:29,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16122#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 72))} is VALID [2022-04-15 06:02:29,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {16122#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 72))} assume !(~x~0 % 4294967296 < 268435455); {16082#false} is VALID [2022-04-15 06:02:29,310 INFO L272 TraceCheckUtils]: 43: Hoare triple {16082#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16082#false} is VALID [2022-04-15 06:02:29,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {16082#false} ~cond := #in~cond; {16082#false} is VALID [2022-04-15 06:02:29,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {16082#false} assume 0 == ~cond; {16082#false} is VALID [2022-04-15 06:02:29,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {16082#false} assume !false; {16082#false} is VALID [2022-04-15 06:02:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:29,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54716925] [2022-04-15 06:02:29,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54716925] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:29,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640489811] [2022-04-15 06:02:29,311 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:02:29,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:29,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:29,312 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:02:29,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-04-15 06:02:32,756 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-15 06:02:32,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:32,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-15 06:02:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:32,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:33,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {16081#true} call ULTIMATE.init(); {16081#true} is VALID [2022-04-15 06:02:33,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {16081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-15 06:02:33,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-15 06:02:33,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-15 06:02:33,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {16081#true} call #t~ret4 := main(); {16081#true} is VALID [2022-04-15 06:02:33,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {16081#true} ~x~0 := 0; {16086#(= main_~x~0 0)} is VALID [2022-04-15 06:02:33,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {16086#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:33,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:33,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:33,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:33,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:33,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:33,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:33,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:33,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:33,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:33,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:33,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:33,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:33,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:33,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:33,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:33,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:33,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:33,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:33,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:33,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:33,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:33,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:33,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:33,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:33,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:33,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:33,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:33,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:33,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:33,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:33,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:33,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:33,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:02:33,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:02:33,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16250#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:02:33,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {16250#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !(~x~0 % 4294967296 < 268435455); {16082#false} is VALID [2022-04-15 06:02:33,242 INFO L272 TraceCheckUtils]: 43: Hoare triple {16082#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16082#false} is VALID [2022-04-15 06:02:33,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {16082#false} ~cond := #in~cond; {16082#false} is VALID [2022-04-15 06:02:33,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {16082#false} assume 0 == ~cond; {16082#false} is VALID [2022-04-15 06:02:33,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {16082#false} assume !false; {16082#false} is VALID [2022-04-15 06:02:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:33,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:37,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {16082#false} assume !false; {16082#false} is VALID [2022-04-15 06:02:37,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {16269#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16082#false} is VALID [2022-04-15 06:02:37,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {16273#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16269#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:02:37,298 INFO L272 TraceCheckUtils]: 43: Hoare triple {16277#(< 0 (mod 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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16273#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:02:37,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {16281#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {16277#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 06:02:37,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {16285#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16281#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {16289#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16285#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {16293#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16289#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {16297#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16293#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {16301#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16297#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {16305#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16301#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {16309#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16305#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {16313#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16309#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {16317#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16313#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {16321#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16317#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {16325#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16321#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {16329#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16325#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {16333#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16329#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {16337#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16333#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {16341#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16337#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {16345#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16341#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {16349#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16345#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {16353#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16349#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {16357#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16353#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {16361#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16357#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {16365#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16361#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} is VALID [2022-04-15 06:02:37,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {16369#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16365#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {16373#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16369#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {16377#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16373#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {16381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16377#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {16385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {16389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {16393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {16397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {16401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {16405#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {16409#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16405#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {16413#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16409#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {16417#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16413#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {16421#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16417#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {16425#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16421#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {16081#true} ~x~0 := 0; {16425#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:02:37,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {16081#true} call #t~ret4 := main(); {16081#true} is VALID [2022-04-15 06:02:37,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-15 06:02:37,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-15 06:02:37,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {16081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-15 06:02:37,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {16081#true} call ULTIMATE.init(); {16081#true} is VALID [2022-04-15 06:02:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:37,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640489811] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:37,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:37,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 42] total 81 [2022-04-15 06:02:37,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:37,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [447949038] [2022-04-15 06:02:37,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [447949038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:37,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:37,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 06:02:37,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314199194] [2022-04-15 06:02:37,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:37,382 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 06:02:37,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:37,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:37,415 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-15 06:02:37,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 06:02:37,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:37,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 06:02:37,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4841, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 06:02:37,417 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:40,532 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 06:02:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 06:02:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 06:02:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 06:02:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 06:02:40,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-15 06:02:40,572 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-15 06:02:40,572 INFO L225 Difference]: With dead ends: 54 [2022-04-15 06:02:40,572 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 06:02:40,573 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3228, Invalid=10578, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 06:02:40,574 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:40,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:02:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 06:02:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 06:02:40,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:40,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:40,625 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:40,625 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:40,627 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 06:02:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 06:02:40,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:40,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:40,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 06:02:40,628 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 06:02:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:40,629 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 06:02:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 06:02:40,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:40,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:40,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:40,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-15 06:02:40,630 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-15 06:02:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:40,631 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-15 06:02:40,631 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:40,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-15 06:02:40,676 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-15 06:02:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 06:02:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 06:02:40,677 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:40,677 INFO L499 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:40,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:40,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-04-15 06:02:41,078 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:41,078 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:41,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 73 times [2022-04-15 06:02:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:41,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691173890] [2022-04-15 06:02:43,300 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:02:43,303 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash 260484599, now seen corresponding path program 1 times [2022-04-15 06:02:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:43,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330947231] [2022-04-15 06:02:43,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:43,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:43,309 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_37.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_37.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:02:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:43,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140211369] [2022-04-15 06:02:43,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:43,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:43,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:43,316 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:02:43,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-04-15 06:02:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:43,359 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:43,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 74 times [2022-04-15 06:02:43,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:43,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143834712] [2022-04-15 06:02:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:44,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:44,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {16867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 06:02:44,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 06:02:44,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-15 06:02:44,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:44,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {16867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 06:02:44,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 06:02:44,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-15 06:02:44,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret4 := main(); {16824#true} is VALID [2022-04-15 06:02:44,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~x~0 := 0; {16829#(= main_~x~0 0)} is VALID [2022-04-15 06:02:44,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {16829#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:44,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:44,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:44,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:44,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:44,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:44,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:44,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:44,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:44,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:44,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:44,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:44,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:44,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:44,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:44,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:44,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:44,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:44,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:44,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:44,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:44,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:44,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:44,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:44,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:44,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:44,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:44,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:44,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:44,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:44,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:44,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:44,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:44,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:02:44,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:02:44,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:02:44,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16866#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 74))} is VALID [2022-04-15 06:02:44,284 INFO L290 TraceCheckUtils]: 43: Hoare triple {16866#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 74))} assume !(~x~0 % 4294967296 < 268435455); {16825#false} is VALID [2022-04-15 06:02:44,284 INFO L272 TraceCheckUtils]: 44: Hoare triple {16825#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16825#false} is VALID [2022-04-15 06:02:44,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-15 06:02:44,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-15 06:02:44,284 INFO L290 TraceCheckUtils]: 47: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-15 06:02:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:44,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143834712] [2022-04-15 06:02:44,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143834712] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:44,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105074115] [2022-04-15 06:02:44,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:02:44,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:44,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:44,292 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:02:44,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-04-15 06:02:44,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:02:44,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:44,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 77 conjunts are in the unsatisfiable core [2022-04-15 06:02:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:44,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:44,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16824#true} is VALID [2022-04-15 06:02:44,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 06:02:44,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 06:02:44,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-15 06:02:44,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret4 := main(); {16824#true} is VALID [2022-04-15 06:02:44,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~x~0 := 0; {16829#(= main_~x~0 0)} is VALID [2022-04-15 06:02:44,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {16829#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:44,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:44,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:44,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:44,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:44,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:44,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:44,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:44,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:44,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:44,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:44,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:44,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:44,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:44,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:44,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:44,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:44,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:44,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:44,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:44,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:44,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:44,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:44,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:44,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:44,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:44,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:44,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:44,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:44,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:44,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:44,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:44,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:44,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:02:44,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:02:44,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:02:44,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16997#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:02:44,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {16997#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !(~x~0 % 4294967296 < 268435455); {16825#false} is VALID [2022-04-15 06:02:44,974 INFO L272 TraceCheckUtils]: 44: Hoare triple {16825#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16825#false} is VALID [2022-04-15 06:02:44,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-15 06:02:44,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-15 06:02:44,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-15 06:02:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:44,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:47,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-15 06:02:47,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-15 06:02:47,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-15 06:02:47,690 INFO L272 TraceCheckUtils]: 44: Hoare triple {16825#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16825#false} is VALID [2022-04-15 06:02:47,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {17025#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {16825#false} is VALID [2022-04-15 06:02:47,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {17029#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17025#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,692 INFO L290 TraceCheckUtils]: 41: Hoare triple {17033#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17029#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {17037#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17033#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {17041#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17037#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {17045#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17041#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {17049#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17045#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {17053#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17049#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {17057#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17053#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {17061#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17057#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {17065#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17061#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {17069#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17065#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {17073#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17069#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {17077#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17073#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {17081#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17077#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {17085#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17081#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {17089#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17085#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {17093#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17089#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {17097#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17093#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {17101#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17097#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {17105#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17101#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {17109#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17105#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {17113#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17109#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {17117#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17113#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {17121#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17117#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {17125#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17121#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {17129#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17125#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {17133#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17129#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {17137#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17133#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {17141#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17137#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {17145#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17141#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {17149#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17145#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {17153#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17149#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {17157#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17153#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {17161#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17157#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {17165#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17161#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {17169#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17165#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {17173#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17169#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~x~0 := 0; {17173#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:02:47,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret4 := main(); {16824#true} is VALID [2022-04-15 06:02:47,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-15 06:02:47,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-15 06:02:47,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-15 06:02:47,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16824#true} is VALID [2022-04-15 06:02:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:47,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105074115] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:47,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:47,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-15 06:02:47,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:47,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691173890] [2022-04-15 06:02:47,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691173890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:47,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:47,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 06:02:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335426250] [2022-04-15 06:02:47,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:47,722 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 06:02:47,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:47,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:47,755 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-15 06:02:47,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 06:02:47,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 06:02:47,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1677, Invalid=4643, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 06:02:47,756 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:51,497 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 06:02:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 06:02:51,497 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 06:02:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 06:02:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 06:02:51,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-15 06:02:51,556 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-15 06:02:51,557 INFO L225 Difference]: With dead ends: 55 [2022-04-15 06:02:51,557 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 06:02:51,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3347, Invalid=10459, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 06:02:51,558 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:51,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 143 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:02:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 06:02:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 06:02:51,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:51,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:51,619 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:51,619 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:51,620 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 06:02:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 06:02:51,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:51,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:51,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 06:02:51,621 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 06:02:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:51,621 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 06:02:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 06:02:51,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:51,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:51,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:51,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:51,627 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-15 06:02:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-15 06:02:51,627 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-15 06:02:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:51,628 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-15 06:02:51,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:51,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-15 06:02:51,674 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-15 06:02:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 06:02:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 06:02:51,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:51,675 INFO L499 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:51,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:51,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:52,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:52,076 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 75 times [2022-04-15 06:02:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:52,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [521889871] [2022-04-15 06:02:52,296 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:02:52,298 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:52,300 INFO L85 PathProgramCache]: Analyzing trace with hash 319589943, now seen corresponding path program 1 times [2022-04-15 06:02:52,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:52,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657591275] [2022-04-15 06:02:52,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:52,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:52,307 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_38.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_38.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:02:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:52,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135535824] [2022-04-15 06:02:52,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:52,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:52,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:52,339 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:02:52,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-04-15 06:02:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:52,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:52,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 76 times [2022-04-15 06:02:52,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:52,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3603431] [2022-04-15 06:02:52,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:52,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:53,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:53,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {17624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-15 06:02:53,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-15 06:02:53,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-15 06:02:53,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {17580#true} call ULTIMATE.init(); {17624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:53,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {17624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-15 06:02:53,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-15 06:02:53,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-15 06:02:53,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {17580#true} call #t~ret4 := main(); {17580#true} is VALID [2022-04-15 06:02:53,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {17580#true} ~x~0 := 0; {17585#(= main_~x~0 0)} is VALID [2022-04-15 06:02:53,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {17585#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:53,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:53,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:53,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:53,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:53,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:53,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:53,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:53,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:53,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:53,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:53,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:53,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:53,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:53,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:53,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:53,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:53,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:53,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:53,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:53,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:53,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:53,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:53,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:53,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:53,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:53,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:53,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:53,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:53,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:53,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:53,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:53,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:53,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:02:53,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:02:53,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:02:53,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:02:53,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17623#(and (<= main_~x~0 76) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:02:53,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {17623#(and (<= main_~x~0 76) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {17581#false} is VALID [2022-04-15 06:02:53,952 INFO L272 TraceCheckUtils]: 45: Hoare triple {17581#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {17581#false} is VALID [2022-04-15 06:02:53,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {17581#false} ~cond := #in~cond; {17581#false} is VALID [2022-04-15 06:02:53,952 INFO L290 TraceCheckUtils]: 47: Hoare triple {17581#false} assume 0 == ~cond; {17581#false} is VALID [2022-04-15 06:02:53,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {17581#false} assume !false; {17581#false} is VALID [2022-04-15 06:02:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:53,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:53,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3603431] [2022-04-15 06:02:53,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3603431] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:53,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668203472] [2022-04-15 06:02:53,953 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:02:53,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:53,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:53,965 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:02:53,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-04-15 06:02:54,072 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:02:54,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:54,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-15 06:02:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:54,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:54,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {17580#true} call ULTIMATE.init(); {17580#true} is VALID [2022-04-15 06:02:54,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {17580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-15 06:02:54,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-15 06:02:54,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-15 06:02:54,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {17580#true} call #t~ret4 := main(); {17580#true} is VALID [2022-04-15 06:02:54,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {17580#true} ~x~0 := 0; {17585#(= main_~x~0 0)} is VALID [2022-04-15 06:02:54,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {17585#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:02:54,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:02:54,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:02:54,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:02:54,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:02:54,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:02:54,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:02:54,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:02:54,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:02:54,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:02:54,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:02:54,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:02:54,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:02:54,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:02:54,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:02:54,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:02:54,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:02:54,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:02:54,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:02:54,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:02:54,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:02:54,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:02:54,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:02:54,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:02:54,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:02:54,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:02:54,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:02:54,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:02:54,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:02:54,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:02:54,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:02:54,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:02:54,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:02:54,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:02:54,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:02:54,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:02:54,701 INFO L290 TraceCheckUtils]: 42: Hoare triple {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:02:54,701 INFO L290 TraceCheckUtils]: 43: Hoare triple {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17757#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:02:54,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {17757#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !(~x~0 % 4294967296 < 268435455); {17581#false} is VALID [2022-04-15 06:02:54,702 INFO L272 TraceCheckUtils]: 45: Hoare triple {17581#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {17581#false} is VALID [2022-04-15 06:02:54,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {17581#false} ~cond := #in~cond; {17581#false} is VALID [2022-04-15 06:02:54,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {17581#false} assume 0 == ~cond; {17581#false} is VALID [2022-04-15 06:02:54,702 INFO L290 TraceCheckUtils]: 48: Hoare triple {17581#false} assume !false; {17581#false} is VALID [2022-04-15 06:02:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:54,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:57,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {17581#false} assume !false; {17581#false} is VALID [2022-04-15 06:02:57,668 INFO L290 TraceCheckUtils]: 47: Hoare triple {17581#false} assume 0 == ~cond; {17581#false} is VALID [2022-04-15 06:02:57,668 INFO L290 TraceCheckUtils]: 46: Hoare triple {17581#false} ~cond := #in~cond; {17581#false} is VALID [2022-04-15 06:02:57,669 INFO L272 TraceCheckUtils]: 45: Hoare triple {17581#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {17581#false} is VALID [2022-04-15 06:02:57,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {17785#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {17581#false} is VALID [2022-04-15 06:02:57,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {17789#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17785#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {17793#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17789#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {17797#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17793#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {17801#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17797#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {17805#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17801#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {17809#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17805#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {17813#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17809#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {17817#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17813#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {17821#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17817#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {17825#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17821#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {17829#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17825#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {17833#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17829#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {17837#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17833#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {17841#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17837#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {17845#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17841#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {17849#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17845#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {17853#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17849#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {17857#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17853#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {17861#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17857#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {17865#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17861#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {17869#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17865#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {17873#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17869#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {17877#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17873#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {17881#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17877#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {17885#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17881#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {17889#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17885#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {17893#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17889#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {17897#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17893#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {17901#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17897#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {17905#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17901#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {17909#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17905#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {17913#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17909#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {17917#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17913#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {17921#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17917#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {17925#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17921#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {17929#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17925#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {17933#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17929#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {17937#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17933#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {17580#true} ~x~0 := 0; {17937#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:02:57,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {17580#true} call #t~ret4 := main(); {17580#true} is VALID [2022-04-15 06:02:57,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-15 06:02:57,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-15 06:02:57,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {17580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-15 06:02:57,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {17580#true} call ULTIMATE.init(); {17580#true} is VALID [2022-04-15 06:02:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:57,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668203472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:57,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:57,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2022-04-15 06:02:57,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:57,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [521889871] [2022-04-15 06:02:57,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [521889871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:57,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:57,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 06:02:57,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747472598] [2022-04-15 06:02:57,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:57,701 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 06:02:57,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:57,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:02:57,734 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-15 06:02:57,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 06:02:57,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:57,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 06:02:57,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1760, Invalid=4882, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:02:57,736 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:01,819 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 06:03:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 06:03:01,819 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 06:03:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-15 06:03:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-15 06:03:01,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-15 06:03:01,903 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-15 06:03:01,904 INFO L225 Difference]: With dead ends: 56 [2022-04-15 06:03:01,904 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 06:03:01,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3513, Invalid=11007, Unknown=0, NotChecked=0, Total=14520 [2022-04-15 06:03:01,905 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:01,906 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 06:03:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 06:03:01,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 06:03:01,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:01,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:01,980 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:01,980 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:01,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:01,981 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 06:03:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 06:03:01,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:01,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:01,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 06:03:01,981 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 06:03:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:01,983 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 06:03:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 06:03:01,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:01,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:01,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:01,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-15 06:03:01,984 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-15 06:03:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:01,984 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-15 06:03:01,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:01,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-15 06:03:02,051 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-15 06:03:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 06:03:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 06:03:02,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:02,052 INFO L499 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:02,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:02,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:02,452 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77 [2022-04-15 06:03:02,452 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:02,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:02,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 77 times [2022-04-15 06:03:02,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:02,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2043140703] [2022-04-15 06:03:02,678 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:03:02,679 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash 378695287, now seen corresponding path program 1 times [2022-04-15 06:03:02,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:02,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410579225] [2022-04-15 06:03:02,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:02,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:02,687 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_39.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_39.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 06:03:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:02,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737558814] [2022-04-15 06:03:02,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:02,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:02,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:02,707 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:03:02,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-04-15 06:03:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:02,781 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:02,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 78 times [2022-04-15 06:03:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:02,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495157232] [2022-04-15 06:03:02,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:03,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:03,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {18397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-15 06:03:03,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-15 06:03:03,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-15 06:03:03,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:03,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {18397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-15 06:03:03,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-15 06:03:03,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-15 06:03:03,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret4 := main(); {18352#true} is VALID [2022-04-15 06:03:03,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#true} ~x~0 := 0; {18357#(= main_~x~0 0)} is VALID [2022-04-15 06:03:03,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {18357#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:03:03,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:03:03,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:03:03,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:03:03,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:03:03,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:03:03,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:03:03,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:03:03,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:03:03,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:03:03,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:03:03,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:03:03,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:03:03,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:03:03,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:03:03,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:03:03,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:03:03,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:03:03,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:03:03,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:03:03,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:03:03,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:03:03,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:03:03,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:03:03,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:03:03,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:03:03,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:03:03,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:03:03,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:03:03,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:03:03,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:03:03,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:03:03,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:03:03,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:03:03,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:03:03,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:03:03,931 INFO L290 TraceCheckUtils]: 42: Hoare triple {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:03:03,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:03:03,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 78))} is VALID [2022-04-15 06:03:03,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {18396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 78))} assume !(~x~0 % 4294967296 < 268435455); {18353#false} is VALID [2022-04-15 06:03:03,933 INFO L272 TraceCheckUtils]: 46: Hoare triple {18353#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {18353#false} is VALID [2022-04-15 06:03:03,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {18353#false} ~cond := #in~cond; {18353#false} is VALID [2022-04-15 06:03:03,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {18353#false} assume 0 == ~cond; {18353#false} is VALID [2022-04-15 06:03:03,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-15 06:03:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:03,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:03,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495157232] [2022-04-15 06:03:03,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495157232] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:03,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295942872] [2022-04-15 06:03:03,934 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:03:03,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:03,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:03,934 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:03:03,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-04-15 06:03:08,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-04-15 06:03:08,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:08,558 WARN L261 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 87 conjunts are in the unsatisfiable core [2022-04-15 06:03:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:08,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:09,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-15 06:03:09,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-15 06:03:09,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-15 06:03:09,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-15 06:03:09,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret4 := main(); {18352#true} is VALID [2022-04-15 06:03:09,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#true} ~x~0 := 0; {18357#(= main_~x~0 0)} is VALID [2022-04-15 06:03:09,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {18357#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:03:09,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:03:09,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:03:09,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:03:09,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:03:09,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:03:09,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:03:09,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:03:09,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:03:09,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:03:09,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:03:09,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:03:09,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:03:09,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:03:09,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:03:09,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:03:09,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:03:09,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:03:09,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:03:09,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:03:09,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:03:09,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:03:09,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:03:09,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:03:09,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:03:09,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:03:09,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:03:09,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:03:09,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:03:09,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:03:09,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:03:09,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:03:09,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:03:09,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:03:09,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:03:09,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:03:09,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:03:09,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:03:09,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18533#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:03:09,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {18533#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !(~x~0 % 4294967296 < 268435455); {18353#false} is VALID [2022-04-15 06:03:09,039 INFO L272 TraceCheckUtils]: 46: Hoare triple {18353#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {18353#false} is VALID [2022-04-15 06:03:09,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {18353#false} ~cond := #in~cond; {18353#false} is VALID [2022-04-15 06:03:09,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {18353#false} assume 0 == ~cond; {18353#false} is VALID [2022-04-15 06:03:09,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-15 06:03:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:09,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:13,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-15 06:03:13,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {18552#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18353#false} is VALID [2022-04-15 06:03:13,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {18556#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18552#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:03:13,061 INFO L272 TraceCheckUtils]: 46: Hoare triple {18560#(not (= (mod main_~x~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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {18556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:03:13,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {18564#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {18560#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:13,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {18568#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18564#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {18572#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18568#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {18576#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18572#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {18580#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18576#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,071 INFO L290 TraceCheckUtils]: 40: Hoare triple {18584#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18580#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {18588#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18584#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {18592#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18588#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {18596#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18592#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {18600#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18596#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {18604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18600#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {18608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {18612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {18616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {18620#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {18624#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18620#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {18628#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18624#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {18632#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18628#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {18636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18632#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {18640#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {18644#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18640#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {18648#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18644#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {18652#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18648#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {18656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18652#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {18660#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {18664#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18660#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {18668#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18664#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {18672#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18668#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {18676#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18672#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {18680#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18676#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {18684#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18680#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {18688#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18684#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {18692#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18688#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {18696#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18692#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {18700#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18696#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {18704#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18700#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {18708#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18704#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {18712#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18708#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {18716#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18712#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {18720#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18716#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:13,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#true} ~x~0 := 0; {18720#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:03:13,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret4 := main(); {18352#true} is VALID [2022-04-15 06:03:13,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-15 06:03:13,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-15 06:03:13,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-15 06:03:13,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-15 06:03:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:13,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295942872] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:13,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:13,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 45] total 87 [2022-04-15 06:03:13,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:13,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2043140703] [2022-04-15 06:03:13,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2043140703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:13,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:13,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 06:03:13,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572665671] [2022-04-15 06:03:13,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:13,229 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 06:03:13,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:13,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:13,279 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-15 06:03:13,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 06:03:13,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:13,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 06:03:13,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5591, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 06:03:13,280 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:17,196 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-15 06:03:17,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 06:03:17,196 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 06:03:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-15 06:03:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-15 06:03:17,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 57 transitions. [2022-04-15 06:03:17,242 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-15 06:03:17,242 INFO L225 Difference]: With dead ends: 57 [2022-04-15 06:03:17,243 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 06:03:17,244 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3729, Invalid=12273, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 06:03:17,244 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:17,245 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:03:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 06:03:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 06:03:17,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:17,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:17,345 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:17,345 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:17,346 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 06:03:17,346 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 06:03:17,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:17,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:17,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 06:03:17,347 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 06:03:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:17,347 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 06:03:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 06:03:17,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:17,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:17,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:17,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:17,348 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-15 06:03:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-15 06:03:17,348 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-15 06:03:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:17,349 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-15 06:03:17,349 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:17,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-15 06:03:17,423 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-15 06:03:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 06:03:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 06:03:17,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:17,424 INFO L499 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:17,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:17,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:17,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,SelfDestructingSolverStorable79,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:17,825 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:17,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1557621980, now seen corresponding path program 79 times [2022-04-15 06:03:17,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:17,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127087658] [2022-04-15 06:03:18,093 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:03:18,095 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash 437800631, now seen corresponding path program 1 times [2022-04-15 06:03:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:18,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349588353] [2022-04-15 06:03:18,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:18,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:18,102 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_40.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_40.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 06:03:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:18,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456126797] [2022-04-15 06:03:18,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:18,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:18,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:18,112 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:03:18,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-04-15 06:03:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:18,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:18,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1557621980, now seen corresponding path program 80 times [2022-04-15 06:03:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:18,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827768322] [2022-04-15 06:03:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:19,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:19,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {19189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19143#true} is VALID [2022-04-15 06:03:19,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {19143#true} assume true; {19143#true} is VALID [2022-04-15 06:03:19,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19143#true} {19143#true} #34#return; {19143#true} is VALID [2022-04-15 06:03:19,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {19143#true} call ULTIMATE.init(); {19189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:19,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {19189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19143#true} is VALID [2022-04-15 06:03:19,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {19143#true} assume true; {19143#true} is VALID [2022-04-15 06:03:19,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19143#true} {19143#true} #34#return; {19143#true} is VALID [2022-04-15 06:03:19,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {19143#true} call #t~ret4 := main(); {19143#true} is VALID [2022-04-15 06:03:19,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {19143#true} ~x~0 := 0; {19148#(= main_~x~0 0)} is VALID [2022-04-15 06:03:19,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {19148#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19149#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:03:19,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {19149#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19150#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:03:19,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {19150#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19151#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:03:19,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {19151#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19152#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:03:19,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {19152#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19153#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:03:19,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {19153#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19154#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:03:19,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {19154#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19155#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:03:19,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {19155#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19156#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:03:19,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {19156#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19157#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:03:19,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {19157#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19158#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:03:19,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {19158#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19159#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:03:19,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {19159#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19160#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:03:19,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {19160#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19161#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:03:19,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {19161#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19162#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:03:19,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {19162#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19163#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:03:19,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {19163#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19164#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:03:19,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {19164#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19165#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:03:19,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {19165#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19166#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:03:19,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {19166#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19167#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:03:19,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {19167#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19168#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:03:19,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {19168#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19169#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:03:19,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {19169#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19170#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:03:19,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {19170#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19171#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:03:19,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {19171#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19172#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:03:19,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {19172#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19173#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:03:19,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {19173#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19174#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:03:19,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {19174#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19175#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:03:19,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {19175#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19176#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:03:19,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {19176#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19177#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:03:19,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {19177#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19178#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:03:19,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {19178#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19179#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:03:19,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {19179#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19180#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:03:19,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {19180#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19181#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:03:19,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {19181#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19182#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:03:19,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {19182#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19183#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:03:19,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {19183#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19184#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:03:19,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {19184#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19185#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:03:19,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {19185#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19186#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:03:19,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {19186#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19187#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:03:19,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {19187#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19188#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 80))} is VALID [2022-04-15 06:03:19,544 INFO L290 TraceCheckUtils]: 46: Hoare triple {19188#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 80))} assume !(~x~0 % 4294967296 < 268435455); {19144#false} is VALID [2022-04-15 06:03:19,544 INFO L272 TraceCheckUtils]: 47: Hoare triple {19144#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19144#false} is VALID [2022-04-15 06:03:19,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {19144#false} ~cond := #in~cond; {19144#false} is VALID [2022-04-15 06:03:19,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {19144#false} assume 0 == ~cond; {19144#false} is VALID [2022-04-15 06:03:19,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {19144#false} assume !false; {19144#false} is VALID [2022-04-15 06:03:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:19,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:19,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827768322] [2022-04-15 06:03:19,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827768322] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:19,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757279039] [2022-04-15 06:03:19,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:03:19,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:19,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:19,546 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:03:19,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-04-15 06:03:19,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:03:19,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:19,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-15 06:03:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:19,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:20,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {19143#true} call ULTIMATE.init(); {19143#true} is VALID [2022-04-15 06:03:20,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {19143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19143#true} is VALID [2022-04-15 06:03:20,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {19143#true} assume true; {19143#true} is VALID [2022-04-15 06:03:20,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19143#true} {19143#true} #34#return; {19143#true} is VALID [2022-04-15 06:03:20,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {19143#true} call #t~ret4 := main(); {19143#true} is VALID [2022-04-15 06:03:20,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {19143#true} ~x~0 := 0; {19148#(= main_~x~0 0)} is VALID [2022-04-15 06:03:20,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {19148#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19149#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:03:20,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {19149#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19150#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:03:20,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {19150#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19151#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:03:20,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {19151#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19152#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:03:20,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {19152#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19153#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:03:20,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {19153#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19154#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:03:20,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {19154#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19155#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:03:20,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {19155#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19156#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:03:20,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {19156#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19157#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:03:20,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {19157#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19158#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:03:20,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {19158#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19159#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:03:20,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {19159#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19160#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:03:20,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {19160#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19161#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:03:20,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {19161#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19162#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:03:20,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {19162#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19163#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:03:20,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {19163#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19164#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:03:20,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {19164#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19165#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:03:20,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {19165#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19166#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:03:20,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {19166#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19167#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:03:20,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {19167#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19168#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:03:20,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {19168#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19169#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:03:20,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {19169#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19170#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:03:20,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {19170#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19171#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:03:20,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {19171#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19172#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:03:20,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {19172#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19173#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:03:20,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {19173#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19174#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:03:20,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {19174#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19175#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:03:20,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {19175#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19176#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:03:20,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {19176#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19177#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:03:20,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {19177#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19178#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:03:20,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {19178#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19179#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:03:20,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {19179#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19180#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:03:20,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {19180#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19181#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:03:20,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {19181#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19182#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:03:20,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {19182#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19183#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:03:20,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {19183#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19184#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:03:20,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {19184#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19185#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:03:20,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {19185#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19186#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:03:20,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {19186#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19187#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:03:20,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {19187#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19328#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:03:20,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {19328#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !(~x~0 % 4294967296 < 268435455); {19144#false} is VALID [2022-04-15 06:03:20,376 INFO L272 TraceCheckUtils]: 47: Hoare triple {19144#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19144#false} is VALID [2022-04-15 06:03:20,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {19144#false} ~cond := #in~cond; {19144#false} is VALID [2022-04-15 06:03:20,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {19144#false} assume 0 == ~cond; {19144#false} is VALID [2022-04-15 06:03:20,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {19144#false} assume !false; {19144#false} is VALID [2022-04-15 06:03:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:20,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:23,661 INFO L290 TraceCheckUtils]: 50: Hoare triple {19144#false} assume !false; {19144#false} is VALID [2022-04-15 06:03:23,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {19144#false} assume 0 == ~cond; {19144#false} is VALID [2022-04-15 06:03:23,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {19144#false} ~cond := #in~cond; {19144#false} is VALID [2022-04-15 06:03:23,662 INFO L272 TraceCheckUtils]: 47: Hoare triple {19144#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19144#false} is VALID [2022-04-15 06:03:23,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {19356#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {19144#false} is VALID [2022-04-15 06:03:23,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {19360#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19356#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {19364#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19360#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {19368#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19364#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {19372#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19368#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,667 INFO L290 TraceCheckUtils]: 41: Hoare triple {19376#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19372#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,667 INFO L290 TraceCheckUtils]: 40: Hoare triple {19380#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19376#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {19384#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19380#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {19388#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19384#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {19392#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19388#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {19396#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19392#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {19400#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19396#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {19404#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19400#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {19408#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19404#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {19412#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19408#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {19416#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19412#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {19420#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19416#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {19424#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19420#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {19428#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19424#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {19432#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19428#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {19436#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19432#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {19440#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19436#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {19444#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19440#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {19448#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19444#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {19452#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19448#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {19456#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19452#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {19460#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19456#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {19464#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19460#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {19468#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19464#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {19472#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19468#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {19476#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19472#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {19480#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19476#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {19484#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19480#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {19488#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19484#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {19492#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19488#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {19496#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19492#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {19500#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19496#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {19504#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19500#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {19508#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19504#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {19512#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19508#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {19516#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19512#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {19143#true} ~x~0 := 0; {19516#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:03:23,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {19143#true} call #t~ret4 := main(); {19143#true} is VALID [2022-04-15 06:03:23,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19143#true} {19143#true} #34#return; {19143#true} is VALID [2022-04-15 06:03:23,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {19143#true} assume true; {19143#true} is VALID [2022-04-15 06:03:23,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {19143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19143#true} is VALID [2022-04-15 06:03:23,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {19143#true} call ULTIMATE.init(); {19143#true} is VALID [2022-04-15 06:03:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:23,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757279039] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:23,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:23,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-15 06:03:23,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:23,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127087658] [2022-04-15 06:03:23,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127087658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:23,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:23,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 06:03:23,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272103969] [2022-04-15 06:03:23,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:23,695 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 06:03:23,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:23,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:23,761 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-15 06:03:23,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 06:03:23,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:23,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 06:03:23,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1932, Invalid=5378, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 06:03:23,762 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:27,836 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 06:03:27,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 06:03:27,837 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 06:03:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-15 06:03:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-15 06:03:27,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 58 transitions. [2022-04-15 06:03:27,875 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-15 06:03:27,876 INFO L225 Difference]: With dead ends: 58 [2022-04-15 06:03:27,876 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:03:27,877 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3857, Invalid=12145, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 06:03:27,878 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:27,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 06:03:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:03:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 06:03:27,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:27,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:27,950 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:27,951 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:27,951 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 06:03:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 06:03:27,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:27,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:27,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:03:27,952 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:03:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:27,953 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 06:03:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 06:03:27,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:27,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:27,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:27,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-15 06:03:27,954 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2022-04-15 06:03:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:27,954 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-15 06:03:27,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:27,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-15 06:03:28,011 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-15 06:03:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 06:03:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 06:03:28,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:28,012 INFO L499 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:28,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:28,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:28,412 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:28,413 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:28,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:28,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1078102390, now seen corresponding path program 81 times [2022-04-15 06:03:28,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:28,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [189396217] [2022-04-15 06:03:28,565 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:03:28,567 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 496905975, now seen corresponding path program 1 times [2022-04-15 06:03:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:28,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085977494] [2022-04-15 06:03:28,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:28,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:28,573 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_41.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_41.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:03:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:28,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956434565] [2022-04-15 06:03:28,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:28,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:28,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:28,584 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:03:28,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-04-15 06:03:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:28,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:28,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:28,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1078102390, now seen corresponding path program 82 times [2022-04-15 06:03:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:28,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968417777] [2022-04-15 06:03:28,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:28,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:29,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:29,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {19994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19947#true} is VALID [2022-04-15 06:03:29,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {19947#true} assume true; {19947#true} is VALID [2022-04-15 06:03:29,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19947#true} {19947#true} #34#return; {19947#true} is VALID [2022-04-15 06:03:29,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {19947#true} call ULTIMATE.init(); {19994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:29,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {19994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19947#true} is VALID [2022-04-15 06:03:29,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {19947#true} assume true; {19947#true} is VALID [2022-04-15 06:03:29,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19947#true} {19947#true} #34#return; {19947#true} is VALID [2022-04-15 06:03:29,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {19947#true} call #t~ret4 := main(); {19947#true} is VALID [2022-04-15 06:03:29,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {19947#true} ~x~0 := 0; {19952#(= main_~x~0 0)} is VALID [2022-04-15 06:03:29,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {19952#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19953#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:03:29,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {19953#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:03:29,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {19954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19955#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:03:29,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {19955#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19956#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:03:29,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {19956#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19957#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:03:29,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {19957#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19958#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:03:29,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {19958#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19959#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:03:29,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {19959#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19960#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:03:29,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {19960#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19961#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:03:29,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {19961#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19962#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:03:29,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {19962#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19963#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:03:29,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {19963#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19964#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:03:29,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {19964#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19965#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:03:29,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {19965#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19966#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:03:29,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {19966#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19967#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:03:29,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {19967#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19968#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:03:29,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {19968#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19969#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:03:29,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {19969#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19970#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:03:29,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {19970#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19971#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:03:29,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {19971#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19972#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:03:29,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {19972#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19973#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:03:29,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {19973#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19974#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:03:29,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {19974#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19975#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:03:29,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {19975#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19976#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:03:29,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {19976#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19977#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:03:29,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {19977#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19978#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:03:29,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {19978#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19979#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:03:29,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {19979#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19980#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:03:29,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {19980#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19981#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:03:29,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {19981#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19982#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:03:29,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {19982#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19983#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:03:29,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {19983#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19984#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:03:29,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {19984#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19985#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:03:29,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {19985#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19986#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:03:29,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {19986#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19987#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:03:29,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {19987#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19988#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:03:29,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {19988#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19989#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:03:29,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {19989#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19990#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:03:29,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {19990#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19991#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:03:29,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {19991#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19992#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:03:29,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {19992#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19993#(and (<= main_~x~0 82) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:03:29,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {19993#(and (<= main_~x~0 82) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {19948#false} is VALID [2022-04-15 06:03:29,726 INFO L272 TraceCheckUtils]: 48: Hoare triple {19948#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19948#false} is VALID [2022-04-15 06:03:29,726 INFO L290 TraceCheckUtils]: 49: Hoare triple {19948#false} ~cond := #in~cond; {19948#false} is VALID [2022-04-15 06:03:29,726 INFO L290 TraceCheckUtils]: 50: Hoare triple {19948#false} assume 0 == ~cond; {19948#false} is VALID [2022-04-15 06:03:29,726 INFO L290 TraceCheckUtils]: 51: Hoare triple {19948#false} assume !false; {19948#false} is VALID [2022-04-15 06:03:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:29,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:29,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968417777] [2022-04-15 06:03:29,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968417777] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:29,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323342229] [2022-04-15 06:03:29,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:03:29,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:29,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:29,727 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:03:29,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-04-15 06:03:29,809 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:03:29,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:29,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-15 06:03:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:29,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:30,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {19947#true} call ULTIMATE.init(); {19947#true} is VALID [2022-04-15 06:03:30,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {19947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19947#true} is VALID [2022-04-15 06:03:30,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {19947#true} assume true; {19947#true} is VALID [2022-04-15 06:03:30,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19947#true} {19947#true} #34#return; {19947#true} is VALID [2022-04-15 06:03:30,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {19947#true} call #t~ret4 := main(); {19947#true} is VALID [2022-04-15 06:03:30,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {19947#true} ~x~0 := 0; {19952#(= main_~x~0 0)} is VALID [2022-04-15 06:03:30,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {19952#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19953#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:03:30,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {19953#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:03:30,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {19954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19955#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:03:30,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {19955#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19956#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:03:30,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {19956#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19957#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:03:30,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {19957#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19958#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:03:30,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {19958#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19959#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:03:30,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {19959#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19960#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:03:30,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {19960#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19961#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:03:30,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {19961#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19962#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:03:30,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {19962#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19963#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:03:30,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {19963#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19964#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:03:30,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {19964#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19965#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:03:30,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {19965#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19966#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:03:30,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {19966#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19967#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:03:30,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {19967#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19968#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:03:30,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {19968#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19969#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:03:30,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {19969#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19970#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:03:30,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {19970#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19971#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:03:30,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {19971#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19972#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:03:30,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {19972#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19973#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:03:30,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {19973#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19974#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:03:30,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {19974#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19975#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:03:30,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {19975#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19976#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:03:30,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {19976#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19977#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:03:30,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {19977#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19978#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:03:30,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {19978#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19979#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:03:30,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {19979#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19980#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:03:30,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {19980#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19981#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:03:30,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {19981#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19982#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:03:30,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {19982#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19983#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:03:30,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {19983#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19984#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:03:30,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {19984#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19985#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:03:30,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {19985#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19986#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:03:30,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {19986#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19987#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:03:30,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {19987#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19988#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:03:30,402 INFO L290 TraceCheckUtils]: 42: Hoare triple {19988#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19989#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:03:30,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {19989#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19990#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:03:30,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {19990#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19991#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:03:30,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {19991#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19992#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:03:30,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {19992#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20136#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:03:30,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {20136#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !(~x~0 % 4294967296 < 268435455); {19948#false} is VALID [2022-04-15 06:03:30,405 INFO L272 TraceCheckUtils]: 48: Hoare triple {19948#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19948#false} is VALID [2022-04-15 06:03:30,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {19948#false} ~cond := #in~cond; {19948#false} is VALID [2022-04-15 06:03:30,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {19948#false} assume 0 == ~cond; {19948#false} is VALID [2022-04-15 06:03:30,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {19948#false} assume !false; {19948#false} is VALID [2022-04-15 06:03:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:30,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:33,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {19948#false} assume !false; {19948#false} is VALID [2022-04-15 06:03:33,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {19948#false} assume 0 == ~cond; {19948#false} is VALID [2022-04-15 06:03:33,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {19948#false} ~cond := #in~cond; {19948#false} is VALID [2022-04-15 06:03:33,218 INFO L272 TraceCheckUtils]: 48: Hoare triple {19948#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19948#false} is VALID [2022-04-15 06:03:33,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {20164#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {19948#false} is VALID [2022-04-15 06:03:33,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {20168#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20164#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {20172#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20168#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {20176#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20172#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {20180#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20176#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {20184#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20180#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,229 INFO L290 TraceCheckUtils]: 41: Hoare triple {20188#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20184#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {20192#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20188#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {20196#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20192#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {20200#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20196#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {20204#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20200#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {20208#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20204#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {20212#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20208#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {20216#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20212#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {20220#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20216#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {20224#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20220#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {20228#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20224#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {20232#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20228#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {20236#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20232#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {20240#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20236#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {20244#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20240#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {20248#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20244#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {20252#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20248#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {20256#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20252#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {20260#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20256#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {20264#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20260#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {20268#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20264#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {20272#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20268#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {20276#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20272#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {20280#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20276#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {20284#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20280#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {20288#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20284#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {20292#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20288#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {20296#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20292#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {20300#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20296#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {20304#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20300#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {20308#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20304#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {20312#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20308#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {20316#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20312#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {20320#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20316#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {20324#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20320#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {20328#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20324#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {19947#true} ~x~0 := 0; {20328#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:03:33,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {19947#true} call #t~ret4 := main(); {19947#true} is VALID [2022-04-15 06:03:33,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19947#true} {19947#true} #34#return; {19947#true} is VALID [2022-04-15 06:03:33,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {19947#true} assume true; {19947#true} is VALID [2022-04-15 06:03:33,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {19947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19947#true} is VALID [2022-04-15 06:03:33,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {19947#true} call ULTIMATE.init(); {19947#true} is VALID [2022-04-15 06:03:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:33,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323342229] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:33,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:33,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 88 [2022-04-15 06:03:33,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:33,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [189396217] [2022-04-15 06:03:33,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [189396217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:33,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:33,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 06:03:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013345239] [2022-04-15 06:03:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 06:03:33,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:33,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:33,300 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-15 06:03:33,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 06:03:33,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:33,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 06:03:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2021, Invalid=5635, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 06:03:33,302 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:37,513 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 06:03:37,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 06:03:37,514 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 06:03:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-15 06:03:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-15 06:03:37,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-15 06:03:37,553 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-15 06:03:37,554 INFO L225 Difference]: With dead ends: 59 [2022-04-15 06:03:37,554 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 06:03:37,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4035, Invalid=12735, Unknown=0, NotChecked=0, Total=16770 [2022-04-15 06:03:37,555 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:37,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:03:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 06:03:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 06:03:37,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:37,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:37,611 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:37,611 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:37,612 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 06:03:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 06:03:37,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:37,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:37,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 06:03:37,613 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 06:03:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:37,614 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 06:03:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 06:03:37,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:37,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:37,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:37,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:37,614 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-15 06:03:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-15 06:03:37,615 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2022-04-15 06:03:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:37,615 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-15 06:03:37,615 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:37,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 54 transitions. [2022-04-15 06:03:37,676 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-15 06:03:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 06:03:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 06:03:37,677 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:37,677 INFO L499 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:37,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:37,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2022-04-15 06:03:38,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:38,078 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:38,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash -902103012, now seen corresponding path program 83 times [2022-04-15 06:03:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:38,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1000648937] [2022-04-15 06:03:38,251 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:03:38,252 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:38,262 INFO L85 PathProgramCache]: Analyzing trace with hash 556011319, now seen corresponding path program 1 times [2022-04-15 06:03:38,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:38,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360890895] [2022-04-15 06:03:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:38,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:38,266 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_42.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_42.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:03:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:38,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133283264] [2022-04-15 06:03:38,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:38,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:38,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:38,270 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:03:38,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-04-15 06:03:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:38,317 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:38,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash -902103012, now seen corresponding path program 84 times [2022-04-15 06:03:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:38,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006478899] [2022-04-15 06:03:38,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:39,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:39,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {20815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20767#true} is VALID [2022-04-15 06:03:39,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {20767#true} assume true; {20767#true} is VALID [2022-04-15 06:03:39,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20767#true} {20767#true} #34#return; {20767#true} is VALID [2022-04-15 06:03:39,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {20767#true} call ULTIMATE.init(); {20815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:39,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {20815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20767#true} is VALID [2022-04-15 06:03:39,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {20767#true} assume true; {20767#true} is VALID [2022-04-15 06:03:39,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20767#true} {20767#true} #34#return; {20767#true} is VALID [2022-04-15 06:03:39,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {20767#true} call #t~ret4 := main(); {20767#true} is VALID [2022-04-15 06:03:39,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {20767#true} ~x~0 := 0; {20772#(= main_~x~0 0)} is VALID [2022-04-15 06:03:39,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {20772#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20773#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:03:39,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {20773#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20774#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:03:39,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {20774#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:03:39,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {20775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20776#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:03:39,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {20776#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:03:39,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {20777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20778#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:03:39,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {20778#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20779#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:03:39,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {20779#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20780#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:03:39,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {20780#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20781#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:03:39,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {20781#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20782#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:03:39,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {20782#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20783#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:03:39,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {20783#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20784#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:03:39,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {20784#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20785#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:03:39,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {20785#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20786#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:03:39,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {20786#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20787#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:03:39,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {20787#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20788#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:03:39,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {20788#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20789#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:03:39,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {20789#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20790#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:03:39,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {20790#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20791#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:03:39,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {20791#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20792#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:03:39,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {20792#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20793#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:03:39,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {20793#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20794#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:03:39,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {20794#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20795#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:03:39,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {20795#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20796#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:03:39,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {20796#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20797#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:03:39,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {20797#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20798#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:03:39,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {20798#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20799#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:03:39,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {20799#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20800#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:03:39,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {20800#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20801#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:03:39,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {20801#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20802#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:03:39,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {20802#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20803#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:03:39,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {20803#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20804#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:03:39,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {20804#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20805#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:03:39,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {20805#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20806#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:03:39,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {20806#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20807#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:03:39,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {20807#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20808#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:03:39,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {20808#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20809#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:03:39,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {20809#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20810#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:03:39,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {20810#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20811#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:03:39,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {20811#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20812#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:03:39,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {20812#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20813#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:03:39,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {20813#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20814#(and (<= main_~x~0 84) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:03:39,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {20814#(and (<= main_~x~0 84) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {20768#false} is VALID [2022-04-15 06:03:39,623 INFO L272 TraceCheckUtils]: 49: Hoare triple {20768#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {20768#false} is VALID [2022-04-15 06:03:39,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {20768#false} ~cond := #in~cond; {20768#false} is VALID [2022-04-15 06:03:39,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {20768#false} assume 0 == ~cond; {20768#false} is VALID [2022-04-15 06:03:39,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {20768#false} assume !false; {20768#false} is VALID [2022-04-15 06:03:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:39,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:39,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006478899] [2022-04-15 06:03:39,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006478899] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:39,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123268304] [2022-04-15 06:03:39,624 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:03:39,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:39,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:39,626 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:03:39,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-04-15 06:03:43,043 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-15 06:03:43,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:43,049 WARN L261 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 90 conjunts are in the unsatisfiable core [2022-04-15 06:03:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:43,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:43,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {20767#true} call ULTIMATE.init(); {20767#true} is VALID [2022-04-15 06:03:43,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {20767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20767#true} is VALID [2022-04-15 06:03:43,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {20767#true} assume true; {20767#true} is VALID [2022-04-15 06:03:43,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20767#true} {20767#true} #34#return; {20767#true} is VALID [2022-04-15 06:03:43,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {20767#true} call #t~ret4 := main(); {20767#true} is VALID [2022-04-15 06:03:43,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {20767#true} ~x~0 := 0; {20772#(= main_~x~0 0)} is VALID [2022-04-15 06:03:43,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {20772#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20773#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:03:43,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {20773#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20774#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:03:43,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {20774#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:03:43,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {20775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20776#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:03:43,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {20776#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:03:43,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {20777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20778#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:03:43,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {20778#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20779#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:03:43,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {20779#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20780#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:03:43,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {20780#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20781#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:03:43,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {20781#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20782#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:03:43,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {20782#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20783#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:03:43,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {20783#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20784#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:03:43,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {20784#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20785#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:03:43,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {20785#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20786#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:03:43,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {20786#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20787#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:03:43,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {20787#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20788#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:03:43,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {20788#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20789#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:03:43,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {20789#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20790#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:03:43,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {20790#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20791#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:03:43,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {20791#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20792#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:03:43,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {20792#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20793#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:03:43,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {20793#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20794#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:03:43,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {20794#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20795#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:03:43,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {20795#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20796#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:03:43,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {20796#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20797#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:03:43,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {20797#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20798#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:03:43,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {20798#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20799#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:03:43,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {20799#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20800#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:03:43,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {20800#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20801#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:03:43,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {20801#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20802#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:03:43,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {20802#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20803#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:03:43,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {20803#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20804#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:03:43,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {20804#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20805#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:03:43,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {20805#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20806#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:03:43,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {20806#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20807#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:03:43,546 INFO L290 TraceCheckUtils]: 41: Hoare triple {20807#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20808#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:03:43,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {20808#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20809#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:03:43,547 INFO L290 TraceCheckUtils]: 43: Hoare triple {20809#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20810#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:03:43,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {20810#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20811#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:03:43,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {20811#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20812#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:03:43,552 INFO L290 TraceCheckUtils]: 46: Hoare triple {20812#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20813#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:03:43,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {20813#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20960#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:03:43,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {20960#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !(~x~0 % 4294967296 < 268435455); {20768#false} is VALID [2022-04-15 06:03:43,554 INFO L272 TraceCheckUtils]: 49: Hoare triple {20768#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {20768#false} is VALID [2022-04-15 06:03:43,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {20768#false} ~cond := #in~cond; {20768#false} is VALID [2022-04-15 06:03:43,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {20768#false} assume 0 == ~cond; {20768#false} is VALID [2022-04-15 06:03:43,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {20768#false} assume !false; {20768#false} is VALID [2022-04-15 06:03:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:43,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:47,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {20768#false} assume !false; {20768#false} is VALID [2022-04-15 06:03:47,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {20979#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20768#false} is VALID [2022-04-15 06:03:47,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {20983#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20979#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:03:47,961 INFO L272 TraceCheckUtils]: 49: Hoare triple {20987#(< 0 (mod 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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {20983#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:03:47,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {20991#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {20987#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 06:03:47,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {20995#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20991#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {20999#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20995#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {21003#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20999#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {21007#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21003#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,972 INFO L290 TraceCheckUtils]: 43: Hoare triple {21011#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21007#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {21015#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21011#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {21019#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21015#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {21023#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21019#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {21027#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21023#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {21031#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21027#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {21035#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21031#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {21039#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21035#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {21043#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21039#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {21047#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21043#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {21051#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21047#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {21055#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21051#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {21059#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21055#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:47,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {21063#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21059#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {21067#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21063#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {21071#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21067#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {21075#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21071#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} is VALID [2022-04-15 06:03:48,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {21079#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21075#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {21083#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21079#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {21087#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21083#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {21091#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21087#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {21095#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21091#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {21099#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21095#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {21103#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21099#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {21107#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21103#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {21111#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21107#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {21115#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21111#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {21119#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21115#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {21123#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21119#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {21127#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21123#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {21131#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21127#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {21135#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21131#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {21139#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21135#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {21143#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21139#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {21147#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 78) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21143#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {21151#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21147#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 78) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {21155#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 82) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21151#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {21159#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 84 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21155#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 82) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {20767#true} ~x~0 := 0; {21159#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 84 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:03:48,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {20767#true} call #t~ret4 := main(); {20767#true} is VALID [2022-04-15 06:03:48,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20767#true} {20767#true} #34#return; {20767#true} is VALID [2022-04-15 06:03:48,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {20767#true} assume true; {20767#true} is VALID [2022-04-15 06:03:48,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {20767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20767#true} is VALID [2022-04-15 06:03:48,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {20767#true} call ULTIMATE.init(); {20767#true} is VALID [2022-04-15 06:03:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:48,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123268304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:48,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:48,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 48] total 93 [2022-04-15 06:03:48,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:48,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1000648937] [2022-04-15 06:03:48,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1000648937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:48,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:48,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 06:03:48,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728418958] [2022-04-15 06:03:48,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:48,102 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 06:03:48,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:48,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:48,136 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-15 06:03:48,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 06:03:48,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:48,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 06:03:48,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6395, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 06:03:48,138 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:52,543 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 06:03:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 06:03:52,544 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 06:03:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-15 06:03:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-15 06:03:52,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-15 06:03:52,583 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-15 06:03:52,584 INFO L225 Difference]: With dead ends: 60 [2022-04-15 06:03:52,584 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 06:03:52,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4266, Invalid=14094, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 06:03:52,585 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:52,586 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1883 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:03:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 06:03:52,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 06:03:52,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:52,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:52,642 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:52,642 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:52,642 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 06:03:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 06:03:52,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:52,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:52,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 06:03:52,643 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 06:03:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:52,643 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 06:03:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 06:03:52,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:52,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:52,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:52,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-15 06:03:52,645 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2022-04-15 06:03:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:52,645 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-15 06:03:52,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:52,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-15 06:03:52,707 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-15 06:03:52,708 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 06:03:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 06:03:52,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:52,708 INFO L499 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:52,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:52,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2022-04-15 06:03:53,109 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:53,109 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:53,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:53,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2136038966, now seen corresponding path program 85 times [2022-04-15 06:03:53,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:53,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2126963264] [2022-04-15 06:03:53,269 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:03:53,271 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:53,272 INFO L85 PathProgramCache]: Analyzing trace with hash 615116663, now seen corresponding path program 1 times [2022-04-15 06:03:53,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:53,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200754862] [2022-04-15 06:03:53,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:53,276 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_43.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_43.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:03:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:53,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288211554] [2022-04-15 06:03:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:53,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:53,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:53,289 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:03:53,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-04-15 06:03:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:53,334 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:53,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2136038966, now seen corresponding path program 86 times [2022-04-15 06:03:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:53,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712251009] [2022-04-15 06:03:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:54,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:54,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {21655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21606#true} is VALID [2022-04-15 06:03:54,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {21606#true} assume true; {21606#true} is VALID [2022-04-15 06:03:54,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21606#true} {21606#true} #34#return; {21606#true} is VALID [2022-04-15 06:03:54,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {21606#true} call ULTIMATE.init(); {21655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:54,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {21655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21606#true} is VALID [2022-04-15 06:03:54,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {21606#true} assume true; {21606#true} is VALID [2022-04-15 06:03:54,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21606#true} {21606#true} #34#return; {21606#true} is VALID [2022-04-15 06:03:54,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {21606#true} call #t~ret4 := main(); {21606#true} is VALID [2022-04-15 06:03:54,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {21606#true} ~x~0 := 0; {21611#(= main_~x~0 0)} is VALID [2022-04-15 06:03:54,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {21611#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21612#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:03:54,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {21612#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:03:54,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {21613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:03:54,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {21614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21615#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:03:54,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {21615#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21616#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:03:54,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {21616#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21617#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:03:54,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {21617#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21618#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:03:54,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {21618#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21619#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:03:54,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {21619#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:03:54,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {21620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21621#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:03:54,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {21621#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21622#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:03:54,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {21622#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21623#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:03:54,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {21623#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21624#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:03:54,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {21624#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21625#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:03:54,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {21625#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21626#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:03:54,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {21626#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21627#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:03:54,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {21627#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21628#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:03:54,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {21628#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21629#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:03:54,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {21629#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21630#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:03:54,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {21630#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21631#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:03:54,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {21631#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21632#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:03:54,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {21632#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21633#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:03:54,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {21633#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21634#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:03:54,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {21634#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21635#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:03:54,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {21635#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21636#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:03:54,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {21636#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21637#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:03:54,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {21637#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21638#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:03:54,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {21638#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21639#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:03:54,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {21639#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21640#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:03:54,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {21640#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21641#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:03:54,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {21641#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21642#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:03:54,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {21642#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21643#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:03:54,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {21643#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21644#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:03:54,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {21644#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21645#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:03:54,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {21645#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21646#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:03:54,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {21646#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21647#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:03:54,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {21647#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21648#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:03:54,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {21648#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21649#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:03:54,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {21649#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21650#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:03:54,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {21650#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21651#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:03:54,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {21651#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21652#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:03:54,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {21652#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21653#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:03:54,530 INFO L290 TraceCheckUtils]: 48: Hoare triple {21653#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21654#(and (<= main_~x~0 86) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:03:54,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {21654#(and (<= main_~x~0 86) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {21607#false} is VALID [2022-04-15 06:03:54,530 INFO L272 TraceCheckUtils]: 50: Hoare triple {21607#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {21607#false} is VALID [2022-04-15 06:03:54,530 INFO L290 TraceCheckUtils]: 51: Hoare triple {21607#false} ~cond := #in~cond; {21607#false} is VALID [2022-04-15 06:03:54,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {21607#false} assume 0 == ~cond; {21607#false} is VALID [2022-04-15 06:03:54,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {21607#false} assume !false; {21607#false} is VALID [2022-04-15 06:03:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:54,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:54,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712251009] [2022-04-15 06:03:54,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712251009] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:54,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922398099] [2022-04-15 06:03:54,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:03:54,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:54,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:54,532 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:03:54,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-04-15 06:03:54,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:03:54,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:54,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-15 06:03:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:54,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:55,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {21606#true} call ULTIMATE.init(); {21606#true} is VALID [2022-04-15 06:03:55,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {21606#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21606#true} is VALID [2022-04-15 06:03:55,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {21606#true} assume true; {21606#true} is VALID [2022-04-15 06:03:55,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21606#true} {21606#true} #34#return; {21606#true} is VALID [2022-04-15 06:03:55,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {21606#true} call #t~ret4 := main(); {21606#true} is VALID [2022-04-15 06:03:55,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {21606#true} ~x~0 := 0; {21611#(= main_~x~0 0)} is VALID [2022-04-15 06:03:55,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {21611#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21612#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:03:55,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {21612#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:03:55,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {21613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:03:55,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {21614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21615#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:03:55,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {21615#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21616#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:03:55,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {21616#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21617#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:03:55,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {21617#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21618#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:03:55,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {21618#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21619#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:03:55,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {21619#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:03:55,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {21620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21621#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:03:55,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {21621#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21622#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:03:55,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {21622#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21623#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:03:55,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {21623#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21624#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:03:55,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {21624#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21625#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:03:55,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {21625#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21626#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:03:55,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {21626#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21627#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:03:55,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {21627#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21628#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:03:55,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {21628#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21629#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:03:55,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {21629#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21630#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:03:55,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {21630#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21631#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:03:55,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {21631#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21632#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:03:55,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {21632#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21633#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:03:55,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {21633#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21634#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:03:55,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {21634#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21635#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:03:55,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {21635#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21636#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:03:55,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {21636#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21637#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:03:55,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {21637#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21638#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:03:55,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {21638#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21639#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:03:55,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {21639#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21640#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:03:55,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {21640#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21641#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:03:55,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {21641#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21642#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:03:55,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {21642#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21643#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:03:55,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {21643#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21644#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:03:55,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {21644#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21645#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:03:55,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {21645#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21646#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:03:55,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {21646#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21647#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:03:55,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {21647#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21648#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:03:55,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {21648#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21649#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:03:55,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {21649#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21650#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:03:55,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {21650#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21651#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:03:55,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {21651#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21652#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:03:55,174 INFO L290 TraceCheckUtils]: 47: Hoare triple {21652#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21653#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:03:55,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {21653#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21803#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:03:55,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {21803#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {21607#false} is VALID [2022-04-15 06:03:55,175 INFO L272 TraceCheckUtils]: 50: Hoare triple {21607#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {21607#false} is VALID [2022-04-15 06:03:55,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {21607#false} ~cond := #in~cond; {21607#false} is VALID [2022-04-15 06:03:55,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {21607#false} assume 0 == ~cond; {21607#false} is VALID [2022-04-15 06:03:55,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {21607#false} assume !false; {21607#false} is VALID [2022-04-15 06:03:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:55,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:58,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {21607#false} assume !false; {21607#false} is VALID [2022-04-15 06:03:58,250 INFO L290 TraceCheckUtils]: 52: Hoare triple {21607#false} assume 0 == ~cond; {21607#false} is VALID [2022-04-15 06:03:58,250 INFO L290 TraceCheckUtils]: 51: Hoare triple {21607#false} ~cond := #in~cond; {21607#false} is VALID [2022-04-15 06:03:58,250 INFO L272 TraceCheckUtils]: 50: Hoare triple {21607#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {21607#false} is VALID [2022-04-15 06:03:58,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {21831#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {21607#false} is VALID [2022-04-15 06:03:58,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {21835#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21831#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,252 INFO L290 TraceCheckUtils]: 47: Hoare triple {21839#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21835#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {21843#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21839#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {21847#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21843#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {21851#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21847#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {21855#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21851#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {21859#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21855#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {21863#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21859#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {21867#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21863#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {21871#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21867#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {21875#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21871#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {21879#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21875#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {21883#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21879#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,260 INFO L290 TraceCheckUtils]: 35: Hoare triple {21887#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21883#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {21891#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21887#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {21895#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21891#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {21899#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21895#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {21903#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21899#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {21907#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21903#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {21911#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21907#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {21915#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21911#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {21919#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21915#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {21923#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21919#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {21927#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21923#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {21931#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21927#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {21935#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21931#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {21939#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21935#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {21943#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21939#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {21947#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21943#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {21951#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21947#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {21955#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21951#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {21959#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21955#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {21963#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21959#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {21967#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21963#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {21971#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21967#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {21975#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21971#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {21979#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21975#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {21983#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21979#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {21987#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21983#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {21991#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21987#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {21995#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21991#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {21999#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21995#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {22003#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21999#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {21606#true} ~x~0 := 0; {22003#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:03:58,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {21606#true} call #t~ret4 := main(); {21606#true} is VALID [2022-04-15 06:03:58,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21606#true} {21606#true} #34#return; {21606#true} is VALID [2022-04-15 06:03:58,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {21606#true} assume true; {21606#true} is VALID [2022-04-15 06:03:58,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {21606#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21606#true} is VALID [2022-04-15 06:03:58,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {21606#true} call ULTIMATE.init(); {21606#true} is VALID [2022-04-15 06:03:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:03:58,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922398099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:58,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:58,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-15 06:03:58,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:58,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2126963264] [2022-04-15 06:03:58,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2126963264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:58,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:58,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 06:03:58,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308394553] [2022-04-15 06:03:58,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:58,279 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 06:03:58,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:58,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:03:58,309 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-15 06:03:58,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 06:03:58,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:58,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 06:03:58,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2205, Invalid=6167, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 06:03:58,310 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:02,859 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-15 06:04:02,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 06:04:02,859 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 06:04:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-15 06:04:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-15 06:04:02,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 61 transitions. [2022-04-15 06:04:02,909 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-15 06:04:02,910 INFO L225 Difference]: With dead ends: 61 [2022-04-15 06:04:02,910 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 06:04:02,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4403, Invalid=13957, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 06:04:02,911 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:02,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 06:04:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 06:04:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 06:04:02,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:02,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:02,971 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:02,971 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:02,972 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 06:04:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 06:04:02,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:02,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:02,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 06:04:02,973 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 06:04:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:02,973 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 06:04:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 06:04:02,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:02,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:02,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:02,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:02,974 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-15 06:04:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-15 06:04:02,975 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2022-04-15 06:04:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:02,975 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-15 06:04:02,975 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:02,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-15 06:04:03,021 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-15 06:04:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 06:04:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 06:04:03,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:03,021 INFO L499 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:03,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-04-15 06:04:03,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-04-15 06:04:03,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:03,429 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1829159772, now seen corresponding path program 87 times [2022-04-15 06:04:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:03,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [347548376] [2022-04-15 06:04:05,620 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:04:05,713 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:04:05,715 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:04:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash 674222007, now seen corresponding path program 1 times [2022-04-15 06:04:05,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:05,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044061481] [2022-04-15 06:04:05,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:05,723 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_44.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_44.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 06:04:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:04:05,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740191147] [2022-04-15 06:04:05,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:05,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:05,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:05,732 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:04:05,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-04-15 06:04:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:05,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:04:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:05,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:04:05,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1829159772, now seen corresponding path program 88 times [2022-04-15 06:04:05,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:05,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972247110] [2022-04-15 06:04:05,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:05,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:07,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {22508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22458#true} is VALID [2022-04-15 06:04:07,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {22458#true} assume true; {22458#true} is VALID [2022-04-15 06:04:07,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22458#true} {22458#true} #34#return; {22458#true} is VALID [2022-04-15 06:04:07,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {22458#true} call ULTIMATE.init(); {22508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:07,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {22508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22458#true} is VALID [2022-04-15 06:04:07,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {22458#true} assume true; {22458#true} is VALID [2022-04-15 06:04:07,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22458#true} {22458#true} #34#return; {22458#true} is VALID [2022-04-15 06:04:07,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {22458#true} call #t~ret4 := main(); {22458#true} is VALID [2022-04-15 06:04:07,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {22458#true} ~x~0 := 0; {22463#(= main_~x~0 0)} is VALID [2022-04-15 06:04:07,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {22463#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22464#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:04:07,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {22464#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:04:07,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {22465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22466#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:04:07,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {22466#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22467#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:04:07,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {22467#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:04:07,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {22468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:04:07,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {22469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:04:07,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {22470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22471#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:04:07,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {22471#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22472#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:04:07,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {22472#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22473#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:04:07,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {22473#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22474#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:04:07,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {22474#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:04:07,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {22475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22476#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:04:07,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {22476#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22477#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:04:07,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {22477#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22478#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:04:07,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {22478#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22479#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:04:07,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {22479#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22480#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:04:07,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {22480#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22481#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:04:07,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {22481#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22482#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:04:07,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {22482#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22483#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:04:07,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {22483#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22484#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:04:07,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {22484#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22485#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:04:07,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {22485#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22486#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:04:07,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {22486#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22487#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:04:07,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {22487#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22488#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:04:07,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {22488#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22489#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:04:07,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {22489#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22490#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:04:07,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {22490#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22491#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:04:07,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {22491#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22492#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:04:07,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {22492#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22493#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:04:07,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {22493#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22494#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:04:07,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {22494#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22495#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:04:07,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {22495#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22496#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:04:07,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {22496#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22497#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:04:07,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {22497#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22498#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:04:07,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {22498#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22499#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:04:07,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {22499#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22500#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:04:07,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {22500#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22501#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:04:07,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {22501#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22502#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:04:07,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {22502#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22503#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:04:07,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {22503#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22504#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:04:07,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {22504#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22505#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:04:07,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {22505#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22506#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:04:07,109 INFO L290 TraceCheckUtils]: 49: Hoare triple {22506#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22507#(and (<= main_~x~0 88) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:04:07,110 INFO L290 TraceCheckUtils]: 50: Hoare triple {22507#(and (<= main_~x~0 88) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {22459#false} is VALID [2022-04-15 06:04:07,110 INFO L272 TraceCheckUtils]: 51: Hoare triple {22459#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {22459#false} is VALID [2022-04-15 06:04:07,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {22459#false} ~cond := #in~cond; {22459#false} is VALID [2022-04-15 06:04:07,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {22459#false} assume 0 == ~cond; {22459#false} is VALID [2022-04-15 06:04:07,110 INFO L290 TraceCheckUtils]: 54: Hoare triple {22459#false} assume !false; {22459#false} is VALID [2022-04-15 06:04:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:07,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:07,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972247110] [2022-04-15 06:04:07,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972247110] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:07,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995179883] [2022-04-15 06:04:07,111 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:04:07,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:07,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:07,116 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:04:07,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-04-15 06:04:07,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:04:07,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:07,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 91 conjunts are in the unsatisfiable core [2022-04-15 06:04:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:07,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:07,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {22458#true} call ULTIMATE.init(); {22458#true} is VALID [2022-04-15 06:04:07,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {22458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22458#true} is VALID [2022-04-15 06:04:07,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {22458#true} assume true; {22458#true} is VALID [2022-04-15 06:04:07,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22458#true} {22458#true} #34#return; {22458#true} is VALID [2022-04-15 06:04:07,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {22458#true} call #t~ret4 := main(); {22458#true} is VALID [2022-04-15 06:04:07,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {22458#true} ~x~0 := 0; {22463#(= main_~x~0 0)} is VALID [2022-04-15 06:04:07,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {22463#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22464#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:04:07,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {22464#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:04:07,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {22465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22466#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:04:07,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {22466#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22467#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:04:07,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {22467#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:04:07,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {22468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:04:07,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {22469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:04:07,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {22470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22471#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:04:07,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {22471#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22472#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:04:07,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {22472#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22473#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:04:07,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {22473#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22474#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:04:07,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {22474#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:04:07,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {22475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22476#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:04:07,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {22476#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22477#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:04:07,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {22477#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22478#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:04:07,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {22478#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22479#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:04:07,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {22479#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22480#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:04:07,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {22480#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22481#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:04:07,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {22481#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22482#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:04:07,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {22482#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22483#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:04:07,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {22483#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22484#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:04:07,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {22484#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22485#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:04:07,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {22485#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22486#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:04:07,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {22486#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22487#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:04:07,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {22487#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22488#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:04:07,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {22488#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22489#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:04:07,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {22489#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22490#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:04:07,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {22490#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22491#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:04:07,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {22491#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22492#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:04:07,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {22492#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22493#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:04:07,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {22493#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22494#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:04:07,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {22494#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22495#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:04:07,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {22495#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22496#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:04:07,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {22496#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22497#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:04:07,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {22497#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22498#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:04:07,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {22498#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22499#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:04:07,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {22499#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22500#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:04:07,826 INFO L290 TraceCheckUtils]: 43: Hoare triple {22500#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22501#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:04:07,826 INFO L290 TraceCheckUtils]: 44: Hoare triple {22501#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22502#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:04:07,827 INFO L290 TraceCheckUtils]: 45: Hoare triple {22502#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22503#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:04:07,827 INFO L290 TraceCheckUtils]: 46: Hoare triple {22503#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22504#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:04:07,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {22504#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22505#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:04:07,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {22505#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22506#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:04:07,829 INFO L290 TraceCheckUtils]: 49: Hoare triple {22506#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22659#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:04:07,829 INFO L290 TraceCheckUtils]: 50: Hoare triple {22659#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {22459#false} is VALID [2022-04-15 06:04:07,829 INFO L272 TraceCheckUtils]: 51: Hoare triple {22459#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {22459#false} is VALID [2022-04-15 06:04:07,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {22459#false} ~cond := #in~cond; {22459#false} is VALID [2022-04-15 06:04:07,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {22459#false} assume 0 == ~cond; {22459#false} is VALID [2022-04-15 06:04:07,830 INFO L290 TraceCheckUtils]: 54: Hoare triple {22459#false} assume !false; {22459#false} is VALID [2022-04-15 06:04:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:07,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:11,082 INFO L290 TraceCheckUtils]: 54: Hoare triple {22459#false} assume !false; {22459#false} is VALID [2022-04-15 06:04:11,082 INFO L290 TraceCheckUtils]: 53: Hoare triple {22459#false} assume 0 == ~cond; {22459#false} is VALID [2022-04-15 06:04:11,082 INFO L290 TraceCheckUtils]: 52: Hoare triple {22459#false} ~cond := #in~cond; {22459#false} is VALID [2022-04-15 06:04:11,082 INFO L272 TraceCheckUtils]: 51: Hoare triple {22459#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {22459#false} is VALID [2022-04-15 06:04:11,082 INFO L290 TraceCheckUtils]: 50: Hoare triple {22687#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {22459#false} is VALID [2022-04-15 06:04:11,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {22691#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22687#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {22695#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22691#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {22699#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22695#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,085 INFO L290 TraceCheckUtils]: 46: Hoare triple {22703#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22699#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {22707#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22703#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {22711#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22707#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {22715#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22711#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {22719#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22715#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {22723#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22719#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {22727#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22723#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {22731#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22727#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {22735#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22731#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {22739#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22735#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {22743#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22739#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {22747#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22743#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {22751#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22747#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {22755#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22751#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {22759#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22755#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {22763#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22759#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {22767#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22763#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {22771#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22767#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {22775#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22771#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {22779#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22775#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {22783#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22779#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {22787#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22783#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {22791#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22787#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {22795#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22791#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {22799#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22795#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {22803#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22799#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {22807#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22803#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {22811#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22807#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {22815#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22811#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {22819#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22815#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {22823#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22819#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {22827#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22823#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {22831#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22827#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {22835#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22831#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {22839#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22835#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {22843#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22839#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {22847#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22843#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {22851#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22847#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {22855#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22851#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {22859#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22855#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {22863#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22859#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {22458#true} ~x~0 := 0; {22863#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:11,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {22458#true} call #t~ret4 := main(); {22458#true} is VALID [2022-04-15 06:04:11,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22458#true} {22458#true} #34#return; {22458#true} is VALID [2022-04-15 06:04:11,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {22458#true} assume true; {22458#true} is VALID [2022-04-15 06:04:11,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {22458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22458#true} is VALID [2022-04-15 06:04:11,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {22458#true} call ULTIMATE.init(); {22458#true} is VALID [2022-04-15 06:04:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:11,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995179883] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:11,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:11,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2022-04-15 06:04:11,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:11,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [347548376] [2022-04-15 06:04:11,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [347548376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:11,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:11,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 06:04:11,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905088414] [2022-04-15 06:04:11,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:11,122 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 06:04:11,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:11,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:11,156 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-15 06:04:11,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 06:04:11,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:11,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 06:04:11,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=6442, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 06:04:11,157 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:15,296 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 06:04:15,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 06:04:15,296 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 06:04:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-15 06:04:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-15 06:04:15,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 62 transitions. [2022-04-15 06:04:15,346 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-15 06:04:15,347 INFO L225 Difference]: With dead ends: 62 [2022-04-15 06:04:15,347 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 06:04:15,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4593, Invalid=14589, Unknown=0, NotChecked=0, Total=19182 [2022-04-15 06:04:15,348 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:15,348 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 06:04:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 06:04:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 06:04:15,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:15,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:15,410 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:15,410 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:15,411 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-15 06:04:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-15 06:04:15,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:15,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:15,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 06:04:15,411 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 06:04:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:15,412 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-15 06:04:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-15 06:04:15,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:15,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:15,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:15,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-15 06:04:15,413 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2022-04-15 06:04:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:15,413 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-15 06:04:15,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:15,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-15 06:04:15,471 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-15 06:04:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-15 06:04:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 06:04:15,472 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:15,472 INFO L499 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:15,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-04-15 06:04:15,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-04-15 06:04:15,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:15,884 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:15,884 INFO L85 PathProgramCache]: Analyzing trace with hash 905839350, now seen corresponding path program 89 times [2022-04-15 06:04:15,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:15,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1156962240] [2022-04-15 06:04:16,023 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:04:16,025 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:04:16,027 INFO L85 PathProgramCache]: Analyzing trace with hash 733327351, now seen corresponding path program 1 times [2022-04-15 06:04:16,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:16,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622323865] [2022-04-15 06:04:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:16,030 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_45.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_45.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:04:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:04:16,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682915260] [2022-04-15 06:04:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:16,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:16,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:16,034 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:04:16,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-04-15 06:04:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:16,076 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:04:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:16,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:04:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 905839350, now seen corresponding path program 90 times [2022-04-15 06:04:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:16,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363878392] [2022-04-15 06:04:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:17,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:17,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {23377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23326#true} is VALID [2022-04-15 06:04:17,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {23326#true} assume true; {23326#true} is VALID [2022-04-15 06:04:17,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23326#true} {23326#true} #34#return; {23326#true} is VALID [2022-04-15 06:04:17,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {23326#true} call ULTIMATE.init(); {23377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:17,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {23377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23326#true} is VALID [2022-04-15 06:04:17,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {23326#true} assume true; {23326#true} is VALID [2022-04-15 06:04:17,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23326#true} {23326#true} #34#return; {23326#true} is VALID [2022-04-15 06:04:17,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {23326#true} call #t~ret4 := main(); {23326#true} is VALID [2022-04-15 06:04:17,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {23326#true} ~x~0 := 0; {23331#(= main_~x~0 0)} is VALID [2022-04-15 06:04:17,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {23331#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23332#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:04:17,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {23332#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23333#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:04:17,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {23333#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23334#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:04:17,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {23334#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23335#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:04:17,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {23335#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23336#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:04:17,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {23336#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23337#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:04:17,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {23337#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23338#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:04:17,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {23338#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23339#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:04:17,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {23339#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23340#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:04:17,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {23340#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23341#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:04:17,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {23341#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23342#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:04:17,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {23342#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23343#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:04:17,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {23343#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23344#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:04:17,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {23344#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23345#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:04:17,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {23345#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23346#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:04:17,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {23346#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23347#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:04:17,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {23347#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23348#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:04:17,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {23348#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23349#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:04:17,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {23349#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23350#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:04:17,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {23350#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23351#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:04:17,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {23351#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23352#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:04:17,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {23352#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23353#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:04:17,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {23353#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23354#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:04:17,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {23354#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23355#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:04:17,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {23355#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23356#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:04:17,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {23356#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23357#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:04:17,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {23357#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23358#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:04:17,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {23358#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23359#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:04:17,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {23359#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23360#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:04:17,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {23360#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23361#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:04:17,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {23361#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23362#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:04:17,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {23362#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23363#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:04:17,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {23363#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23364#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:04:17,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {23364#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23365#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:04:17,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {23365#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23366#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:04:17,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {23366#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23367#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:04:17,290 INFO L290 TraceCheckUtils]: 42: Hoare triple {23367#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23368#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:04:17,290 INFO L290 TraceCheckUtils]: 43: Hoare triple {23368#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23369#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:04:17,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {23369#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23370#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:04:17,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {23370#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23371#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:04:17,292 INFO L290 TraceCheckUtils]: 46: Hoare triple {23371#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23372#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:04:17,292 INFO L290 TraceCheckUtils]: 47: Hoare triple {23372#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23373#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:04:17,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {23373#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23374#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:04:17,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {23374#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23375#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:04:17,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {23375#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23376#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 90))} is VALID [2022-04-15 06:04:17,294 INFO L290 TraceCheckUtils]: 51: Hoare triple {23376#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 90))} assume !(~x~0 % 4294967296 < 268435455); {23327#false} is VALID [2022-04-15 06:04:17,294 INFO L272 TraceCheckUtils]: 52: Hoare triple {23327#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {23327#false} is VALID [2022-04-15 06:04:17,294 INFO L290 TraceCheckUtils]: 53: Hoare triple {23327#false} ~cond := #in~cond; {23327#false} is VALID [2022-04-15 06:04:17,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {23327#false} assume 0 == ~cond; {23327#false} is VALID [2022-04-15 06:04:17,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {23327#false} assume !false; {23327#false} is VALID [2022-04-15 06:04:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:17,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:17,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363878392] [2022-04-15 06:04:17,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363878392] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:17,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127602030] [2022-04-15 06:04:17,295 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:04:17,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:17,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:17,296 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:04:17,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-04-15 06:04:23,736 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2022-04-15 06:04:23,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:23,746 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 94 conjunts are in the unsatisfiable core [2022-04-15 06:04:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:23,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:24,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {23326#true} call ULTIMATE.init(); {23326#true} is VALID [2022-04-15 06:04:24,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {23326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23326#true} is VALID [2022-04-15 06:04:24,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {23326#true} assume true; {23326#true} is VALID [2022-04-15 06:04:24,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23326#true} {23326#true} #34#return; {23326#true} is VALID [2022-04-15 06:04:24,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {23326#true} call #t~ret4 := main(); {23326#true} is VALID [2022-04-15 06:04:24,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {23326#true} ~x~0 := 0; {23331#(= main_~x~0 0)} is VALID [2022-04-15 06:04:24,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {23331#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23332#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:04:24,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {23332#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23333#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:04:24,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {23333#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23334#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:04:24,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {23334#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23335#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:04:24,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {23335#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23336#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:04:24,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {23336#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23337#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:04:24,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {23337#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23338#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:04:24,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {23338#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23339#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:04:24,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {23339#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23340#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:04:24,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {23340#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23341#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:04:24,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {23341#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23342#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:04:24,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {23342#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23343#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:04:24,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {23343#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23344#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:04:24,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {23344#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23345#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:04:24,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {23345#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23346#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:04:24,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {23346#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23347#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:04:24,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {23347#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23348#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:04:24,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {23348#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23349#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:04:24,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {23349#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23350#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:04:24,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {23350#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23351#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:04:24,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {23351#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23352#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:04:24,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {23352#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23353#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:04:24,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {23353#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23354#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:04:24,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {23354#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23355#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:04:24,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {23355#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23356#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:04:24,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {23356#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23357#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:04:24,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {23357#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23358#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:04:24,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {23358#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23359#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:04:24,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {23359#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23360#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:04:24,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {23360#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23361#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:04:24,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {23361#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23362#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:04:24,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {23362#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23363#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:04:24,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {23363#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23364#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:04:24,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {23364#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23365#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:04:24,352 INFO L290 TraceCheckUtils]: 40: Hoare triple {23365#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23366#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:04:24,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {23366#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23367#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:04:24,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {23367#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23368#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:04:24,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {23368#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23369#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:04:24,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {23369#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23370#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:04:24,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {23370#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23371#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:04:24,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {23371#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23372#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:04:24,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {23372#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23373#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:04:24,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {23373#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23374#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:04:24,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {23374#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23375#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:04:24,365 INFO L290 TraceCheckUtils]: 50: Hoare triple {23375#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23531#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:04:24,366 INFO L290 TraceCheckUtils]: 51: Hoare triple {23531#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !(~x~0 % 4294967296 < 268435455); {23327#false} is VALID [2022-04-15 06:04:24,366 INFO L272 TraceCheckUtils]: 52: Hoare triple {23327#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {23327#false} is VALID [2022-04-15 06:04:24,366 INFO L290 TraceCheckUtils]: 53: Hoare triple {23327#false} ~cond := #in~cond; {23327#false} is VALID [2022-04-15 06:04:24,366 INFO L290 TraceCheckUtils]: 54: Hoare triple {23327#false} assume 0 == ~cond; {23327#false} is VALID [2022-04-15 06:04:24,366 INFO L290 TraceCheckUtils]: 55: Hoare triple {23327#false} assume !false; {23327#false} is VALID [2022-04-15 06:04:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:24,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:37,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {23327#false} assume !false; {23327#false} is VALID [2022-04-15 06:04:37,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {23327#false} assume 0 == ~cond; {23327#false} is VALID [2022-04-15 06:04:37,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {23327#false} ~cond := #in~cond; {23327#false} is VALID [2022-04-15 06:04:37,505 INFO L272 TraceCheckUtils]: 52: Hoare triple {23327#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {23327#false} is VALID [2022-04-15 06:04:37,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {23559#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {23327#false} is VALID [2022-04-15 06:04:37,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {23563#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23559#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:04:37,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {23567#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23563#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,508 INFO L290 TraceCheckUtils]: 48: Hoare triple {23571#(or (< (mod (+ main_~x~0 6) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23567#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {23575#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23571#(or (< (mod (+ main_~x~0 6) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,510 INFO L290 TraceCheckUtils]: 46: Hoare triple {23579#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23575#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {23583#(or (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23579#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {23587#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23583#(or (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {23591#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23587#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {23595#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23591#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {23599#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23595#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {23603#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23599#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {23607#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23603#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {23611#(or (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23607#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {23615#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23611#(or (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {23619#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23615#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {23623#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23619#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {23627#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23623#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {23631#(or (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23627#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {23635#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23631#(or (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {23639#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23635#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {23643#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23639#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {23647#(or (< (mod (+ 44 main_~x~0) 4294967296) 268435455) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23643#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {23651#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23647#(or (< (mod (+ 44 main_~x~0) 4294967296) 268435455) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {23655#(or (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23651#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {23659#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23655#(or (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {23663#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23659#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {23667#(or (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23663#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {23671#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23667#(or (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {23675#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23671#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {23679#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (< (mod (+ main_~x~0 58) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23675#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {23683#(or (not (< (mod (+ main_~x~0 60) 4294967296) 268435455)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23679#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (< (mod (+ main_~x~0 58) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {23687#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 62) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23683#(or (not (< (mod (+ main_~x~0 60) 4294967296) 268435455)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {23691#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 268435455)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23687#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 62) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {23695#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 268435455)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23691#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 268435455)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {23699#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (< (mod (+ 68 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23695#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 268435455)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {23703#(or (not (< (mod (+ main_~x~0 70) 4294967296) 268435455)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23699#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (< (mod (+ 68 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {23707#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23703#(or (not (< (mod (+ main_~x~0 70) 4294967296) 268435455)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {23711#(or (not (< (mod (+ main_~x~0 74) 4294967296) 268435455)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23707#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {23715#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (< (mod (+ 76 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23711#(or (not (< (mod (+ main_~x~0 74) 4294967296) 268435455)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {23719#(or (not (< (mod (+ main_~x~0 78) 4294967296) 268435455)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23715#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (< (mod (+ 76 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {23723#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (< (mod (+ main_~x~0 80) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23719#(or (not (< (mod (+ main_~x~0 78) 4294967296) 268435455)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {23727#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 82) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23723#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (< (mod (+ main_~x~0 80) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {23731#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (< (mod (+ 84 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23727#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 82) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {23735#(or (not (< (mod (+ main_~x~0 86) 4294967296) 268435455)) (< (mod (+ 88 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23731#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (< (mod (+ 84 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 06:04:37,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {23739#(or (not (< (mod (+ 88 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23735#(or (not (< (mod (+ main_~x~0 86) 4294967296) 268435455)) (< (mod (+ 88 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {23326#true} ~x~0 := 0; {23739#(or (not (< (mod (+ 88 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-15 06:04:37,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {23326#true} call #t~ret4 := main(); {23326#true} is VALID [2022-04-15 06:04:37,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23326#true} {23326#true} #34#return; {23326#true} is VALID [2022-04-15 06:04:37,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {23326#true} assume true; {23326#true} is VALID [2022-04-15 06:04:37,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {23326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23326#true} is VALID [2022-04-15 06:04:37,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {23326#true} call ULTIMATE.init(); {23326#true} is VALID [2022-04-15 06:04:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:37,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127602030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:37,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:37,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-15 06:04:37,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:37,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1156962240] [2022-04-15 06:04:37,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1156962240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:37,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:37,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 06:04:37,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445587668] [2022-04-15 06:04:37,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:37,544 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 06:04:37,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:37,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:37,581 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-15 06:04:37,581 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 06:04:37,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:37,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 06:04:37,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2397, Invalid=6723, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 06:04:37,582 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:42,069 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-15 06:04:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 06:04:42,069 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 06:04:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-15 06:04:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-15 06:04:42,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 63 transitions. [2022-04-15 06:04:42,117 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-15 06:04:42,118 INFO L225 Difference]: With dead ends: 63 [2022-04-15 06:04:42,118 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 06:04:42,119 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=4787, Invalid=15235, Unknown=0, NotChecked=0, Total=20022 [2022-04-15 06:04:42,119 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:42,119 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2242 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 06:04:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 06:04:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-15 06:04:42,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:42,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:42,182 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:42,182 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:42,183 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 06:04:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 06:04:42,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:42,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:42,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 06:04:42,183 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 06:04:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:42,184 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 06:04:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 06:04:42,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:42,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:42,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:42,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:42,184 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-15 06:04:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-15 06:04:42,185 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2022-04-15 06:04:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:42,185 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-15 06:04:42,185 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:42,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2022-04-15 06:04:42,250 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-15 06:04:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 06:04:42,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 06:04:42,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:42,251 INFO L499 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:42,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-04-15 06:04:42,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Forceful destruction successful, exit code 0 [2022-04-15 06:04:42,652 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable91,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:42,652 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 91 times [2022-04-15 06:04:42,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:42,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2076063791] [2022-04-15 06:04:42,840 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:04:42,842 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:04:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash 792432695, now seen corresponding path program 1 times [2022-04-15 06:04:42,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:42,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671745539] [2022-04-15 06:04:42,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:42,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:42,848 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_46.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_46.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:04:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:04:42,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58998859] [2022-04-15 06:04:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:42,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:42,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:42,856 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:04:42,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-04-15 06:04:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:42,900 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:04:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:42,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:04:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 92 times [2022-04-15 06:04:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:42,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237632551] [2022-04-15 06:04:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:42,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:44,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:44,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {24262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24210#true} is VALID [2022-04-15 06:04:44,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {24210#true} assume true; {24210#true} is VALID [2022-04-15 06:04:44,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24210#true} {24210#true} #34#return; {24210#true} is VALID [2022-04-15 06:04:44,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {24210#true} call ULTIMATE.init(); {24262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:44,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {24262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24210#true} is VALID [2022-04-15 06:04:44,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {24210#true} assume true; {24210#true} is VALID [2022-04-15 06:04:44,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24210#true} {24210#true} #34#return; {24210#true} is VALID [2022-04-15 06:04:44,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {24210#true} call #t~ret4 := main(); {24210#true} is VALID [2022-04-15 06:04:44,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {24210#true} ~x~0 := 0; {24215#(= main_~x~0 0)} is VALID [2022-04-15 06:04:44,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {24215#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24216#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:04:44,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {24216#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:04:44,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {24217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24218#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:04:44,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {24218#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24219#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:04:44,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {24219#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24220#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:04:44,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {24220#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24221#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:04:44,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {24221#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24222#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:04:44,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {24222#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:04:44,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {24223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24224#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:04:44,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {24224#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:04:44,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {24225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24226#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:04:44,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {24226#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24227#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:04:44,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {24227#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24228#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:04:44,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {24228#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24229#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:04:44,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {24229#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24230#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:04:44,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {24230#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24231#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:04:44,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {24231#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24232#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:04:44,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {24232#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24233#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:04:44,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {24233#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24234#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:04:44,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {24234#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24235#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:04:44,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {24235#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24236#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:04:44,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {24236#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24237#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:04:44,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {24237#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24238#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:04:44,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {24238#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24239#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:04:44,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {24239#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24240#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:04:44,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {24240#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24241#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:04:44,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {24241#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24242#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:04:44,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {24242#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24243#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:04:44,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {24243#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24244#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:04:44,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {24244#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24245#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:04:44,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {24245#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24246#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:04:44,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {24246#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24247#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:04:44,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {24247#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24248#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:04:44,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {24248#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24249#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:04:44,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {24249#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24250#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:04:44,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {24250#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24251#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:04:44,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {24251#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24252#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:04:44,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {24252#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24253#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:04:44,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {24253#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24254#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:04:44,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {24254#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24255#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:04:44,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {24255#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24256#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:04:44,134 INFO L290 TraceCheckUtils]: 47: Hoare triple {24256#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24257#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:04:44,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {24257#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24258#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:04:44,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {24258#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24259#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:04:44,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {24259#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24260#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:04:44,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {24260#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24261#(and (<= main_~x~0 92) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:04:44,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {24261#(and (<= main_~x~0 92) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {24211#false} is VALID [2022-04-15 06:04:44,137 INFO L272 TraceCheckUtils]: 53: Hoare triple {24211#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {24211#false} is VALID [2022-04-15 06:04:44,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {24211#false} ~cond := #in~cond; {24211#false} is VALID [2022-04-15 06:04:44,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {24211#false} assume 0 == ~cond; {24211#false} is VALID [2022-04-15 06:04:44,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {24211#false} assume !false; {24211#false} is VALID [2022-04-15 06:04:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:44,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:44,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237632551] [2022-04-15 06:04:44,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237632551] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:44,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390756124] [2022-04-15 06:04:44,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:04:44,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:44,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:44,139 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:04:44,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-04-15 06:04:44,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:04:44,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:44,206 WARN L261 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-15 06:04:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:44,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:44,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {24210#true} call ULTIMATE.init(); {24210#true} is VALID [2022-04-15 06:04:44,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {24210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24210#true} is VALID [2022-04-15 06:04:44,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {24210#true} assume true; {24210#true} is VALID [2022-04-15 06:04:44,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24210#true} {24210#true} #34#return; {24210#true} is VALID [2022-04-15 06:04:44,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {24210#true} call #t~ret4 := main(); {24210#true} is VALID [2022-04-15 06:04:44,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {24210#true} ~x~0 := 0; {24215#(= main_~x~0 0)} is VALID [2022-04-15 06:04:44,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {24215#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24216#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:04:44,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {24216#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:04:44,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {24217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24218#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:04:44,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {24218#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24219#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:04:44,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {24219#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24220#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:04:44,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {24220#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24221#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:04:44,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {24221#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24222#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:04:44,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {24222#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:04:44,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {24223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24224#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:04:44,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {24224#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:04:44,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {24225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24226#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:04:44,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {24226#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24227#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:04:44,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {24227#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24228#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:04:44,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {24228#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24229#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:04:44,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {24229#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24230#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:04:44,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {24230#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24231#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:04:44,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {24231#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24232#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:04:44,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {24232#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24233#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:04:44,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {24233#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24234#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:04:44,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {24234#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24235#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:04:44,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {24235#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24236#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:04:44,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {24236#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24237#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:04:44,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {24237#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24238#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:04:44,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {24238#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24239#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:04:44,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {24239#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24240#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:04:44,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {24240#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24241#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:04:44,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {24241#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24242#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:04:44,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {24242#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24243#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:04:44,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {24243#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24244#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:04:44,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {24244#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24245#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:04:44,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {24245#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24246#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:04:44,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {24246#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24247#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:04:44,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {24247#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24248#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:04:44,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {24248#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24249#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:04:44,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {24249#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24250#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:04:44,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {24250#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24251#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:04:44,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {24251#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24252#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:04:44,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {24252#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24253#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:04:44,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {24253#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24254#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:04:44,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {24254#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24255#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:04:44,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {24255#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24256#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:04:44,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {24256#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24257#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:04:44,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {24257#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24258#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:04:44,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {24258#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24259#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:04:44,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {24259#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24260#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:04:44,803 INFO L290 TraceCheckUtils]: 51: Hoare triple {24260#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24419#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:04:44,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {24419#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {24211#false} is VALID [2022-04-15 06:04:44,804 INFO L272 TraceCheckUtils]: 53: Hoare triple {24211#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {24211#false} is VALID [2022-04-15 06:04:44,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {24211#false} ~cond := #in~cond; {24211#false} is VALID [2022-04-15 06:04:44,804 INFO L290 TraceCheckUtils]: 55: Hoare triple {24211#false} assume 0 == ~cond; {24211#false} is VALID [2022-04-15 06:04:44,804 INFO L290 TraceCheckUtils]: 56: Hoare triple {24211#false} assume !false; {24211#false} is VALID [2022-04-15 06:04:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:44,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:48,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {24211#false} assume !false; {24211#false} is VALID [2022-04-15 06:04:48,283 INFO L290 TraceCheckUtils]: 55: Hoare triple {24211#false} assume 0 == ~cond; {24211#false} is VALID [2022-04-15 06:04:48,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {24211#false} ~cond := #in~cond; {24211#false} is VALID [2022-04-15 06:04:48,283 INFO L272 TraceCheckUtils]: 53: Hoare triple {24211#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {24211#false} is VALID [2022-04-15 06:04:48,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {24447#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {24211#false} is VALID [2022-04-15 06:04:48,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {24451#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24447#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {24455#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24451#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {24459#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24455#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {24463#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24459#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,287 INFO L290 TraceCheckUtils]: 47: Hoare triple {24467#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24463#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {24471#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24467#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {24475#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24471#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,289 INFO L290 TraceCheckUtils]: 44: Hoare triple {24479#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24475#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,289 INFO L290 TraceCheckUtils]: 43: Hoare triple {24483#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24479#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,290 INFO L290 TraceCheckUtils]: 42: Hoare triple {24487#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24483#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,290 INFO L290 TraceCheckUtils]: 41: Hoare triple {24491#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24487#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {24495#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24491#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {24499#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24495#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {24503#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24499#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {24507#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24503#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {24511#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24507#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {24515#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24511#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {24519#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24515#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {24523#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24519#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {24527#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24523#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {24531#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24527#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {24535#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24531#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {24539#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24535#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {24543#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24539#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {24547#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24543#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {24551#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24547#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {24555#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24551#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {24559#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24555#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {24563#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24559#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {24567#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24563#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {24571#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24567#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {24575#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24571#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {24579#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24575#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {24583#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24579#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {24587#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24583#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {24591#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24587#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {24595#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24591#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {24599#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24595#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {24603#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24599#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {24607#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24603#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {24611#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24607#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {24615#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24611#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {24619#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24615#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {24623#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24619#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {24627#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24623#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {24631#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24627#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {24210#true} ~x~0 := 0; {24631#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:48,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {24210#true} call #t~ret4 := main(); {24210#true} is VALID [2022-04-15 06:04:48,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24210#true} {24210#true} #34#return; {24210#true} is VALID [2022-04-15 06:04:48,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {24210#true} assume true; {24210#true} is VALID [2022-04-15 06:04:48,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {24210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24210#true} is VALID [2022-04-15 06:04:48,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {24210#true} call ULTIMATE.init(); {24210#true} is VALID [2022-04-15 06:04:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:48,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390756124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:48,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:48,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-15 06:04:48,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:48,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2076063791] [2022-04-15 06:04:48,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2076063791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:48,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:48,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 06:04:48,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269408045] [2022-04-15 06:04:48,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:48,314 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 06:04:48,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:48,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:48,345 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-15 06:04:48,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 06:04:48,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:48,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 06:04:48,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 06:04:48,347 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:52,705 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 06:04:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 06:04:52,705 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 06:04:52,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-15 06:04:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-15 06:04:52,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-15 06:04:52,759 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-15 06:04:52,759 INFO L225 Difference]: With dead ends: 64 [2022-04-15 06:04:52,759 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 06:04:52,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4985, Invalid=15895, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 06:04:52,761 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:52,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 2284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:04:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 06:04:52,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 06:04:52,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:52,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:52,824 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:52,824 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:52,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:52,824 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 06:04:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 06:04:52,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:52,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:52,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 06:04:52,825 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 06:04:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:52,825 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 06:04:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 06:04:52,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:52,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:52,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:52,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-15 06:04:52,826 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2022-04-15 06:04:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:52,826 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-15 06:04:52,826 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:52,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-15 06:04:52,872 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-15 06:04:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 06:04:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 06:04:52,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:52,873 INFO L499 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:52,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2022-04-15 06:04:53,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2022-04-15 06:04:53,277 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:53,278 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:53,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:53,278 INFO L85 PathProgramCache]: Analyzing trace with hash -199985226, now seen corresponding path program 93 times [2022-04-15 06:04:53,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:53,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837631130] [2022-04-15 06:04:53,449 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:04:53,451 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:04:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash 851538039, now seen corresponding path program 1 times [2022-04-15 06:04:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:53,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703118472] [2022-04-15 06:04:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:53,457 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_47.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_47.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 06:04:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:04:53,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829079071] [2022-04-15 06:04:53,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:53,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:53,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:53,460 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:04:53,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-04-15 06:04:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:53,501 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:04:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:53,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:04:53,508 INFO L85 PathProgramCache]: Analyzing trace with hash -199985226, now seen corresponding path program 94 times [2022-04-15 06:04:53,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:53,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998395993] [2022-04-15 06:04:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:53,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:54,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:54,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {25163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25110#true} is VALID [2022-04-15 06:04:54,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {25110#true} assume true; {25110#true} is VALID [2022-04-15 06:04:54,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25110#true} {25110#true} #34#return; {25110#true} is VALID [2022-04-15 06:04:54,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {25110#true} call ULTIMATE.init(); {25163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:54,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {25163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25110#true} is VALID [2022-04-15 06:04:54,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {25110#true} assume true; {25110#true} is VALID [2022-04-15 06:04:54,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25110#true} {25110#true} #34#return; {25110#true} is VALID [2022-04-15 06:04:54,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {25110#true} call #t~ret4 := main(); {25110#true} is VALID [2022-04-15 06:04:54,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {25110#true} ~x~0 := 0; {25115#(= main_~x~0 0)} is VALID [2022-04-15 06:04:54,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {25115#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25116#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:04:54,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {25116#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25117#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:04:54,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {25117#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25118#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:04:54,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {25118#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25119#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:04:54,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {25119#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25120#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:04:54,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {25120#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25121#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:04:54,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {25121#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25122#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:04:54,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {25122#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25123#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:04:54,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {25123#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25124#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:04:54,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {25124#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25125#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:04:54,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {25125#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25126#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:04:54,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {25126#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25127#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:04:54,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {25127#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25128#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:04:54,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {25128#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25129#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:04:54,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {25129#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25130#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:04:54,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {25130#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25131#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:04:54,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {25131#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25132#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:04:54,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {25132#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25133#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:04:54,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {25133#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25134#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:04:54,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {25134#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25135#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:04:54,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {25135#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25136#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:04:54,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {25136#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25137#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:04:54,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {25137#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25138#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:04:54,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {25138#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25139#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:04:54,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {25139#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25140#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:04:54,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {25140#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25141#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:04:54,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {25141#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25142#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:04:54,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {25142#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25143#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:04:54,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {25143#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25144#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:04:54,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {25144#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25145#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:04:54,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {25145#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25146#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:04:54,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {25146#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25147#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:04:54,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {25147#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25148#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:04:54,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {25148#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25149#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:04:54,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {25149#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25150#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:04:54,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {25150#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25151#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:04:54,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {25151#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25152#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:04:54,790 INFO L290 TraceCheckUtils]: 43: Hoare triple {25152#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25153#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:04:54,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {25153#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25154#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:04:54,791 INFO L290 TraceCheckUtils]: 45: Hoare triple {25154#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25155#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:04:54,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {25155#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25156#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:04:54,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {25156#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25157#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:04:54,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {25157#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25158#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:04:54,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {25158#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25159#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:04:54,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {25159#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25160#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:04:54,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {25160#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25161#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:04:54,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {25161#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25162#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 94))} is VALID [2022-04-15 06:04:54,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {25162#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 94))} assume !(~x~0 % 4294967296 < 268435455); {25111#false} is VALID [2022-04-15 06:04:54,795 INFO L272 TraceCheckUtils]: 54: Hoare triple {25111#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {25111#false} is VALID [2022-04-15 06:04:54,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {25111#false} ~cond := #in~cond; {25111#false} is VALID [2022-04-15 06:04:54,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {25111#false} assume 0 == ~cond; {25111#false} is VALID [2022-04-15 06:04:54,796 INFO L290 TraceCheckUtils]: 57: Hoare triple {25111#false} assume !false; {25111#false} is VALID [2022-04-15 06:04:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:54,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:54,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998395993] [2022-04-15 06:04:54,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998395993] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:54,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853162300] [2022-04-15 06:04:54,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:04:54,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:54,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:54,798 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:04:54,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-04-15 06:04:54,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:04:54,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:54,928 WARN L261 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-15 06:04:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:54,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:55,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {25110#true} call ULTIMATE.init(); {25110#true} is VALID [2022-04-15 06:04:55,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {25110#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25110#true} is VALID [2022-04-15 06:04:55,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {25110#true} assume true; {25110#true} is VALID [2022-04-15 06:04:55,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25110#true} {25110#true} #34#return; {25110#true} is VALID [2022-04-15 06:04:55,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {25110#true} call #t~ret4 := main(); {25110#true} is VALID [2022-04-15 06:04:55,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {25110#true} ~x~0 := 0; {25115#(= main_~x~0 0)} is VALID [2022-04-15 06:04:55,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {25115#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25116#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:04:55,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {25116#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25117#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:04:55,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {25117#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25118#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:04:55,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {25118#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25119#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:04:55,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {25119#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25120#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:04:55,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {25120#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25121#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:04:55,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {25121#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25122#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:04:55,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {25122#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25123#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:04:55,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {25123#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25124#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:04:55,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {25124#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25125#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:04:55,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {25125#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25126#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:04:55,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {25126#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25127#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:04:55,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {25127#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25128#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:04:55,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {25128#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25129#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:04:55,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {25129#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25130#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:04:55,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {25130#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25131#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:04:55,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {25131#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25132#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:04:55,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {25132#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25133#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:04:55,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {25133#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25134#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:04:55,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {25134#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25135#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:04:55,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {25135#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25136#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:04:55,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {25136#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25137#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:04:55,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {25137#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25138#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:04:55,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {25138#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25139#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:04:55,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {25139#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25140#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:04:55,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {25140#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25141#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:04:55,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {25141#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25142#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:04:55,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {25142#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25143#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:04:55,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {25143#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25144#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:04:55,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {25144#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25145#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:04:55,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {25145#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25146#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:04:55,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {25146#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25147#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:04:55,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {25147#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25148#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:04:55,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {25148#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25149#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:04:55,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {25149#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25150#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:04:55,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {25150#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25151#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:04:55,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {25151#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25152#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:04:55,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {25152#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25153#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:04:55,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {25153#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25154#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:04:55,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {25154#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25155#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:04:55,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {25155#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25156#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:04:55,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {25156#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25157#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:04:55,558 INFO L290 TraceCheckUtils]: 48: Hoare triple {25157#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25158#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:04:55,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {25158#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25159#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:04:55,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {25159#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25160#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:04:55,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {25160#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25161#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:04:55,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {25161#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25323#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:04:55,561 INFO L290 TraceCheckUtils]: 53: Hoare triple {25323#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !(~x~0 % 4294967296 < 268435455); {25111#false} is VALID [2022-04-15 06:04:55,561 INFO L272 TraceCheckUtils]: 54: Hoare triple {25111#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {25111#false} is VALID [2022-04-15 06:04:55,561 INFO L290 TraceCheckUtils]: 55: Hoare triple {25111#false} ~cond := #in~cond; {25111#false} is VALID [2022-04-15 06:04:55,561 INFO L290 TraceCheckUtils]: 56: Hoare triple {25111#false} assume 0 == ~cond; {25111#false} is VALID [2022-04-15 06:04:55,561 INFO L290 TraceCheckUtils]: 57: Hoare triple {25111#false} assume !false; {25111#false} is VALID [2022-04-15 06:04:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:55,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:59,582 INFO L290 TraceCheckUtils]: 57: Hoare triple {25111#false} assume !false; {25111#false} is VALID [2022-04-15 06:04:59,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {25111#false} assume 0 == ~cond; {25111#false} is VALID [2022-04-15 06:04:59,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {25111#false} ~cond := #in~cond; {25111#false} is VALID [2022-04-15 06:04:59,582 INFO L272 TraceCheckUtils]: 54: Hoare triple {25111#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {25111#false} is VALID [2022-04-15 06:04:59,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {25351#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {25111#false} is VALID [2022-04-15 06:04:59,583 INFO L290 TraceCheckUtils]: 52: Hoare triple {25355#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25351#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {25359#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25355#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {25363#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25359#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {25367#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25363#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {25371#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25367#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {25375#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25371#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {25379#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25375#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {25383#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25379#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {25387#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25383#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {25391#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25387#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {25395#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25391#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {25399#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25395#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {25403#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25399#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {25407#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25403#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {25411#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25407#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {25415#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25411#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {25419#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25415#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {25423#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25419#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {25427#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25423#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {25431#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25427#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {25435#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25431#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {25439#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25435#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {25443#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25439#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {25447#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25443#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {25451#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25447#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {25455#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25451#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {25459#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25455#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {25463#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25459#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {25467#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25463#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {25471#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25467#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {25475#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25471#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {25479#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25475#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {25483#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25479#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {25487#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25483#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {25491#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25487#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {25495#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25491#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {25499#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25495#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {25503#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25499#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {25507#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25503#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {25511#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25507#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {25515#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25511#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {25519#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25515#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {25523#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25519#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {25527#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25523#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {25531#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25527#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {25535#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25531#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {25539#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25535#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {25110#true} ~x~0 := 0; {25539#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:04:59,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {25110#true} call #t~ret4 := main(); {25110#true} is VALID [2022-04-15 06:04:59,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25110#true} {25110#true} #34#return; {25110#true} is VALID [2022-04-15 06:04:59,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {25110#true} assume true; {25110#true} is VALID [2022-04-15 06:04:59,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {25110#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25110#true} is VALID [2022-04-15 06:04:59,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {25110#true} call ULTIMATE.init(); {25110#true} is VALID [2022-04-15 06:04:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:04:59,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853162300] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:59,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:59,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 100 [2022-04-15 06:04:59,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:59,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837631130] [2022-04-15 06:04:59,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837631130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:59,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:59,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 06:04:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159039469] [2022-04-15 06:04:59,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:59,630 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 06:04:59,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:59,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:04:59,668 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-15 06:04:59,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 06:04:59,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:59,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 06:04:59,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2597, Invalid=7303, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 06:04:59,670 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:05,562 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-15 06:05:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 06:05:05,562 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 06:05:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-15 06:05:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-15 06:05:05,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 65 transitions. [2022-04-15 06:05:05,620 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-15 06:05:05,621 INFO L225 Difference]: With dead ends: 65 [2022-04-15 06:05:05,621 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 06:05:05,623 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5187, Invalid=16569, Unknown=0, NotChecked=0, Total=21756 [2022-04-15 06:05:05,623 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:05,623 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 06:05:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 06:05:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 06:05:05,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:05,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:05,730 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:05,730 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:05,731 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 06:05:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 06:05:05,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:05,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:05,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 06:05:05,731 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 06:05:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:05,732 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 06:05:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 06:05:05,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:05,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:05,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:05,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:05,733 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-15 06:05:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2022-04-15 06:05:05,733 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2022-04-15 06:05:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:05,733 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2022-04-15 06:05:05,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:05,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 60 transitions. [2022-04-15 06:05:05,789 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-15 06:05:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 06:05:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 06:05:05,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:05,790 INFO L499 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:05,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-04-15 06:05:05,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-04-15 06:05:06,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:06,191 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:06,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:06,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1868113444, now seen corresponding path program 95 times [2022-04-15 06:05:06,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:06,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717966414] [2022-04-15 06:05:06,421 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:05:06,423 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:05:06,425 INFO L85 PathProgramCache]: Analyzing trace with hash 910643383, now seen corresponding path program 1 times [2022-04-15 06:05:06,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:06,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670281093] [2022-04-15 06:05:06,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:06,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:06,431 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_48.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_48.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:05:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:05:06,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484453862] [2022-04-15 06:05:06,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:06,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:06,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:06,447 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:05:06,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-04-15 06:05:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:06,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:05:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:06,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:05:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1868113444, now seen corresponding path program 96 times [2022-04-15 06:05:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:06,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554768574] [2022-04-15 06:05:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:08,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:08,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {26080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26026#true} is VALID [2022-04-15 06:05:08,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {26026#true} assume true; {26026#true} is VALID [2022-04-15 06:05:08,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26026#true} {26026#true} #34#return; {26026#true} is VALID [2022-04-15 06:05:08,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {26026#true} call ULTIMATE.init(); {26080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:08,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {26080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26026#true} is VALID [2022-04-15 06:05:08,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {26026#true} assume true; {26026#true} is VALID [2022-04-15 06:05:08,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26026#true} {26026#true} #34#return; {26026#true} is VALID [2022-04-15 06:05:08,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {26026#true} call #t~ret4 := main(); {26026#true} is VALID [2022-04-15 06:05:08,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {26026#true} ~x~0 := 0; {26031#(= main_~x~0 0)} is VALID [2022-04-15 06:05:08,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {26031#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:05:08,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {26032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:05:08,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {26033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26034#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:05:08,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {26034#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26035#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:05:08,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {26035#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26036#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:05:08,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {26036#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26037#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:05:08,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {26037#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26038#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:05:08,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {26038#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:05:08,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {26039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26040#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:05:08,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {26040#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26041#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:05:08,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {26041#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26042#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:05:08,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {26042#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26043#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:05:08,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {26043#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26044#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:05:08,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {26044#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26045#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:05:08,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {26045#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26046#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:05:08,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {26046#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26047#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:05:08,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {26047#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26048#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:05:08,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {26048#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26049#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:05:08,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {26049#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26050#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:05:08,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {26050#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26051#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:05:08,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {26051#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26052#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:05:08,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {26052#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26053#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:05:08,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {26053#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26054#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:05:08,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {26054#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26055#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:05:08,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {26055#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26056#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:05:08,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {26056#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26057#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:05:08,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {26057#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26058#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:05:08,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {26058#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26059#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:05:08,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {26059#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26060#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:05:08,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {26060#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26061#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:05:08,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {26061#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26062#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:05:08,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {26062#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26063#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:05:08,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {26063#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26064#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:05:08,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {26064#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26065#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:05:08,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {26065#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26066#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:05:08,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {26066#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26067#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:05:08,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {26067#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26068#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:05:08,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {26068#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26069#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:05:08,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {26069#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26070#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:05:08,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {26070#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26071#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:05:08,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {26071#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26072#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:05:08,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {26072#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26073#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:05:08,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {26073#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26074#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:05:08,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {26074#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26075#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:05:08,095 INFO L290 TraceCheckUtils]: 50: Hoare triple {26075#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26076#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:05:08,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {26076#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26077#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:05:08,096 INFO L290 TraceCheckUtils]: 52: Hoare triple {26077#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26078#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:05:08,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {26078#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26079#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 96))} is VALID [2022-04-15 06:05:08,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {26079#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 96))} assume !(~x~0 % 4294967296 < 268435455); {26027#false} is VALID [2022-04-15 06:05:08,097 INFO L272 TraceCheckUtils]: 55: Hoare triple {26027#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26027#false} is VALID [2022-04-15 06:05:08,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {26027#false} ~cond := #in~cond; {26027#false} is VALID [2022-04-15 06:05:08,098 INFO L290 TraceCheckUtils]: 57: Hoare triple {26027#false} assume 0 == ~cond; {26027#false} is VALID [2022-04-15 06:05:08,098 INFO L290 TraceCheckUtils]: 58: Hoare triple {26027#false} assume !false; {26027#false} is VALID [2022-04-15 06:05:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:05:08,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:08,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554768574] [2022-04-15 06:05:08,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554768574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:08,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654230171] [2022-04-15 06:05:08,098 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:05:08,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:08,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:08,108 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:05:08,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-04-15 06:05:13,309 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-15 06:05:13,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:13,318 WARN L261 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 105 conjunts are in the unsatisfiable core [2022-04-15 06:05:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:13,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:13,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {26026#true} call ULTIMATE.init(); {26026#true} is VALID [2022-04-15 06:05:13,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {26026#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26026#true} is VALID [2022-04-15 06:05:13,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {26026#true} assume true; {26026#true} is VALID [2022-04-15 06:05:13,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26026#true} {26026#true} #34#return; {26026#true} is VALID [2022-04-15 06:05:13,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {26026#true} call #t~ret4 := main(); {26026#true} is VALID [2022-04-15 06:05:13,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {26026#true} ~x~0 := 0; {26031#(= main_~x~0 0)} is VALID [2022-04-15 06:05:13,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {26031#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:05:13,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {26032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:05:13,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {26033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26034#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:05:13,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {26034#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26035#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:05:13,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {26035#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26036#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:05:13,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {26036#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26037#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:05:13,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {26037#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26038#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:05:13,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {26038#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:05:13,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {26039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26040#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:05:13,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {26040#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26041#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:05:13,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {26041#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26042#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:05:13,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {26042#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26043#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:05:13,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {26043#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26044#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:05:13,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {26044#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26045#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:05:13,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {26045#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26046#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:05:13,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {26046#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26047#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:05:13,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {26047#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26048#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:05:13,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {26048#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26049#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:05:13,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {26049#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26050#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:05:13,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {26050#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26051#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:05:13,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {26051#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26052#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:05:13,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {26052#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26053#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:05:13,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {26053#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26054#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:05:13,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {26054#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26055#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:05:13,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {26055#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26056#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:05:13,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {26056#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26057#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:05:13,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {26057#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26058#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:05:13,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {26058#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26059#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:05:13,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {26059#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26060#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:05:13,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {26060#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26061#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:05:13,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {26061#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26062#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:05:13,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {26062#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26063#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:05:13,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {26063#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26064#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:05:13,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {26064#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26065#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:05:13,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {26065#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26066#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:05:13,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {26066#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26067#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:05:13,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {26067#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26068#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:05:13,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {26068#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26069#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:05:13,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {26069#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26070#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:05:13,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {26070#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26071#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:05:13,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {26071#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26072#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:05:13,977 INFO L290 TraceCheckUtils]: 47: Hoare triple {26072#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26073#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:05:13,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {26073#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26074#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:05:13,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {26074#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26075#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:05:13,979 INFO L290 TraceCheckUtils]: 50: Hoare triple {26075#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26076#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:05:13,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {26076#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26077#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:05:13,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {26077#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26078#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:05:13,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {26078#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26243#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:05:13,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {26243#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !(~x~0 % 4294967296 < 268435455); {26027#false} is VALID [2022-04-15 06:05:13,981 INFO L272 TraceCheckUtils]: 55: Hoare triple {26027#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26027#false} is VALID [2022-04-15 06:05:13,982 INFO L290 TraceCheckUtils]: 56: Hoare triple {26027#false} ~cond := #in~cond; {26027#false} is VALID [2022-04-15 06:05:13,982 INFO L290 TraceCheckUtils]: 57: Hoare triple {26027#false} assume 0 == ~cond; {26027#false} is VALID [2022-04-15 06:05:13,982 INFO L290 TraceCheckUtils]: 58: Hoare triple {26027#false} assume !false; {26027#false} is VALID [2022-04-15 06:05:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:05:13,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:21,083 INFO L290 TraceCheckUtils]: 58: Hoare triple {26027#false} assume !false; {26027#false} is VALID [2022-04-15 06:05:21,084 INFO L290 TraceCheckUtils]: 57: Hoare triple {26262#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26027#false} is VALID [2022-04-15 06:05:21,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {26266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {26262#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:05:21,085 INFO L272 TraceCheckUtils]: 55: Hoare triple {26270#(not (= (mod main_~x~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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:05:21,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {26274#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {26270#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:21,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {26278#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26274#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {26282#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26278#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,088 INFO L290 TraceCheckUtils]: 51: Hoare triple {26286#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26282#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,089 INFO L290 TraceCheckUtils]: 50: Hoare triple {26290#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26286#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {26294#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26290#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,095 INFO L290 TraceCheckUtils]: 48: Hoare triple {26298#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26294#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {26302#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26298#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {26306#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26302#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {26310#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26306#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {26314#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26310#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,100 INFO L290 TraceCheckUtils]: 43: Hoare triple {26318#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26314#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {26322#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26318#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {26326#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26322#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {26330#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26326#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {26334#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26330#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,109 INFO L290 TraceCheckUtils]: 38: Hoare triple {26338#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26334#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {26342#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26338#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {26346#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26342#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {26350#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26346#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {26354#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26350#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {26358#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26354#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {26362#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26358#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {26366#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26362#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {26370#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26366#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {26374#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26370#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {26378#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26374#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {26382#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26378#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {26386#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26382#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {26390#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26386#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {26394#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26390#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {26398#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26394#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {26402#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26398#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {26406#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26402#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {26410#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26406#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {26414#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26410#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {26418#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26414#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {26422#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26418#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {26426#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26422#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {26430#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26426#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {26434#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26430#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {26438#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26434#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {26442#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26438#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {26446#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26442#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {26450#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26446#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {26454#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26450#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {26458#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26454#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {26462#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26458#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {26466#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26462#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:05:21,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {26026#true} ~x~0 := 0; {26466#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} is VALID [2022-04-15 06:05:21,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {26026#true} call #t~ret4 := main(); {26026#true} is VALID [2022-04-15 06:05:21,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26026#true} {26026#true} #34#return; {26026#true} is VALID [2022-04-15 06:05:21,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {26026#true} assume true; {26026#true} is VALID [2022-04-15 06:05:21,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {26026#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26026#true} is VALID [2022-04-15 06:05:21,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {26026#true} call ULTIMATE.init(); {26026#true} is VALID [2022-04-15 06:05:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:05:21,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654230171] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:21,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:21,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 54] total 105 [2022-04-15 06:05:21,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:21,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717966414] [2022-04-15 06:05:21,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717966414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:21,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:21,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 06:05:21,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853806143] [2022-04-15 06:05:21,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:21,192 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 06:05:21,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:21,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:21,236 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-15 06:05:21,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 06:05:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:21,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 06:05:21,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=8165, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 06:05:21,238 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:27,206 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 06:05:27,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 06:05:27,206 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 06:05:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 06:05:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 06:05:27,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-15 06:05:27,254 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-15 06:05:27,255 INFO L225 Difference]: With dead ends: 66 [2022-04-15 06:05:27,255 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 06:05:27,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=5448, Invalid=18114, Unknown=0, NotChecked=0, Total=23562 [2022-04-15 06:05:27,257 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:27,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 06:05:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 06:05:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 06:05:27,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:27,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:27,333 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:27,333 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:27,334 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-15 06:05:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-15 06:05:27,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:27,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:27,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 06:05:27,334 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 06:05:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:27,335 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-15 06:05:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-15 06:05:27,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:27,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:27,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:27,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-15 06:05:27,336 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2022-04-15 06:05:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:27,336 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-15 06:05:27,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:27,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-15 06:05:27,394 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-15 06:05:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-15 06:05:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 06:05:27,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:27,395 INFO L499 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:27,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2022-04-15 06:05:27,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-04-15 06:05:27,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:27,800 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:27,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2040480650, now seen corresponding path program 97 times [2022-04-15 06:05:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:27,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [386317514] [2022-04-15 06:05:27,996 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:05:27,998 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:05:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash 969748727, now seen corresponding path program 1 times [2022-04-15 06:05:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:28,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725673182] [2022-04-15 06:05:28,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:28,005 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_49.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_49.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:05:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:05:28,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177765532] [2022-04-15 06:05:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:28,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:28,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:28,019 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:05:28,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-04-15 06:05:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:28,087 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:05:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:28,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:05:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2040480650, now seen corresponding path program 98 times [2022-04-15 06:05:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:28,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052551252] [2022-04-15 06:05:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:28,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:29,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:29,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {27016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26961#true} is VALID [2022-04-15 06:05:29,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {26961#true} assume true; {26961#true} is VALID [2022-04-15 06:05:29,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26961#true} {26961#true} #34#return; {26961#true} is VALID [2022-04-15 06:05:29,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {26961#true} call ULTIMATE.init(); {27016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:29,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {27016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26961#true} is VALID [2022-04-15 06:05:29,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {26961#true} assume true; {26961#true} is VALID [2022-04-15 06:05:29,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26961#true} {26961#true} #34#return; {26961#true} is VALID [2022-04-15 06:05:29,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {26961#true} call #t~ret4 := main(); {26961#true} is VALID [2022-04-15 06:05:29,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {26961#true} ~x~0 := 0; {26966#(= main_~x~0 0)} is VALID [2022-04-15 06:05:29,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {26966#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26967#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:05:29,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {26967#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26968#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:05:29,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {26968#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26969#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:05:29,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {26969#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26970#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:05:29,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {26970#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26971#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:05:29,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {26971#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26972#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:05:29,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {26972#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26973#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:05:29,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {26973#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26974#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:05:29,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {26974#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:05:29,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {26975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26976#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:05:29,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {26976#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26977#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:05:29,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {26977#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26978#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:05:29,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {26978#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26979#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:05:29,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {26979#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26980#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:05:29,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {26980#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26981#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:05:29,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {26981#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26982#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:05:29,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {26982#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26983#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:05:29,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {26983#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26984#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:05:29,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {26984#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26985#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:05:29,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {26985#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26986#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:05:29,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {26986#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26987#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:05:29,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {26987#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26988#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:05:29,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {26988#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26989#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:05:29,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {26989#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26990#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:05:29,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {26990#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26991#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:05:29,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {26991#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26992#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:05:29,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {26992#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26993#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:05:29,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {26993#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26994#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:05:29,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {26994#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26995#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:05:29,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {26995#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26996#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:05:29,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {26996#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26997#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:05:29,855 INFO L290 TraceCheckUtils]: 37: Hoare triple {26997#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26998#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:05:29,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {26998#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26999#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:05:29,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {26999#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27000#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:05:29,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {27000#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27001#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:05:29,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {27001#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27002#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:05:29,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {27002#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27003#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:05:29,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {27003#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27004#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:05:29,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {27004#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27005#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:05:29,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {27005#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27006#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:05:29,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {27006#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27007#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:05:29,861 INFO L290 TraceCheckUtils]: 47: Hoare triple {27007#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27008#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:05:29,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {27008#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27009#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:05:29,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {27009#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27010#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:05:29,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {27010#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27011#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:05:29,863 INFO L290 TraceCheckUtils]: 51: Hoare triple {27011#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27012#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:05:29,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {27012#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27013#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:05:29,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {27013#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27014#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:05:29,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {27014#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27015#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 98))} is VALID [2022-04-15 06:05:29,866 INFO L290 TraceCheckUtils]: 55: Hoare triple {27015#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 98))} assume !(~x~0 % 4294967296 < 268435455); {26962#false} is VALID [2022-04-15 06:05:29,866 INFO L272 TraceCheckUtils]: 56: Hoare triple {26962#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26962#false} is VALID [2022-04-15 06:05:29,866 INFO L290 TraceCheckUtils]: 57: Hoare triple {26962#false} ~cond := #in~cond; {26962#false} is VALID [2022-04-15 06:05:29,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {26962#false} assume 0 == ~cond; {26962#false} is VALID [2022-04-15 06:05:29,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {26962#false} assume !false; {26962#false} is VALID [2022-04-15 06:05:29,866 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-15 06:05:29,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:29,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052551252] [2022-04-15 06:05:29,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052551252] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:29,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689404312] [2022-04-15 06:05:29,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:05:29,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:29,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:29,868 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:05:29,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-04-15 06:05:30,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:05:30,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:30,015 WARN L261 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 101 conjunts are in the unsatisfiable core [2022-04-15 06:05:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:30,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:30,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {26961#true} call ULTIMATE.init(); {26961#true} is VALID [2022-04-15 06:05:30,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {26961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26961#true} is VALID [2022-04-15 06:05:30,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {26961#true} assume true; {26961#true} is VALID [2022-04-15 06:05:30,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26961#true} {26961#true} #34#return; {26961#true} is VALID [2022-04-15 06:05:30,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {26961#true} call #t~ret4 := main(); {26961#true} is VALID [2022-04-15 06:05:30,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {26961#true} ~x~0 := 0; {26966#(= main_~x~0 0)} is VALID [2022-04-15 06:05:30,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {26966#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26967#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:05:30,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {26967#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26968#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:05:30,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {26968#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26969#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:05:30,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {26969#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26970#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:05:30,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {26970#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26971#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:05:30,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {26971#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26972#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:05:30,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {26972#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26973#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:05:30,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {26973#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26974#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:05:30,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {26974#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:05:30,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {26975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26976#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:05:30,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {26976#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26977#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:05:30,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {26977#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26978#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:05:30,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {26978#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26979#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:05:30,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {26979#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26980#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:05:30,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {26980#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26981#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:05:30,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {26981#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26982#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:05:30,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {26982#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26983#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:05:30,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {26983#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26984#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:05:30,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {26984#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26985#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:05:30,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {26985#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26986#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:05:30,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {26986#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26987#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:05:30,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {26987#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26988#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:05:30,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {26988#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26989#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:05:30,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {26989#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26990#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:05:30,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {26990#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26991#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:05:30,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {26991#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26992#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:05:30,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {26992#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26993#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:05:30,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {26993#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26994#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:05:30,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {26994#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26995#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:05:30,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {26995#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26996#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:05:30,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {26996#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26997#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:05:30,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {26997#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26998#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:05:30,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {26998#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26999#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:05:30,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {26999#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27000#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:05:30,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {27000#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27001#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:05:30,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {27001#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27002#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:05:30,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {27002#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27003#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:05:30,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {27003#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27004#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:05:30,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {27004#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27005#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:05:30,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {27005#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27006#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:05:30,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {27006#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27007#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:05:30,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {27007#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27008#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:05:30,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {27008#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27009#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:05:30,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {27009#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27010#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:05:30,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {27010#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27011#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:05:30,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {27011#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27012#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:05:30,814 INFO L290 TraceCheckUtils]: 52: Hoare triple {27012#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27013#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:05:30,815 INFO L290 TraceCheckUtils]: 53: Hoare triple {27013#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27014#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:05:30,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {27014#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27182#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:05:30,816 INFO L290 TraceCheckUtils]: 55: Hoare triple {27182#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !(~x~0 % 4294967296 < 268435455); {26962#false} is VALID [2022-04-15 06:05:30,816 INFO L272 TraceCheckUtils]: 56: Hoare triple {26962#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26962#false} is VALID [2022-04-15 06:05:30,816 INFO L290 TraceCheckUtils]: 57: Hoare triple {26962#false} ~cond := #in~cond; {26962#false} is VALID [2022-04-15 06:05:30,816 INFO L290 TraceCheckUtils]: 58: Hoare triple {26962#false} assume 0 == ~cond; {26962#false} is VALID [2022-04-15 06:05:30,816 INFO L290 TraceCheckUtils]: 59: Hoare triple {26962#false} assume !false; {26962#false} is VALID [2022-04-15 06:05:30,816 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-15 06:05:30,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:35,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {26962#false} assume !false; {26962#false} is VALID [2022-04-15 06:05:35,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {26962#false} assume 0 == ~cond; {26962#false} is VALID [2022-04-15 06:05:35,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {26962#false} ~cond := #in~cond; {26962#false} is VALID [2022-04-15 06:05:35,208 INFO L272 TraceCheckUtils]: 56: Hoare triple {26962#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26962#false} is VALID [2022-04-15 06:05:35,209 INFO L290 TraceCheckUtils]: 55: Hoare triple {27210#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {26962#false} is VALID [2022-04-15 06:05:35,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {27214#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27210#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {27218#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27214#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,211 INFO L290 TraceCheckUtils]: 52: Hoare triple {27222#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27218#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,212 INFO L290 TraceCheckUtils]: 51: Hoare triple {27226#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27222#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {27230#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27226#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {27234#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27230#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {27238#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27234#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {27242#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27238#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {27246#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27242#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {27250#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27246#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {27254#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27250#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {27258#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27254#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {27262#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27258#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {27266#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27262#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {27270#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27266#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {27274#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27270#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,222 INFO L290 TraceCheckUtils]: 38: Hoare triple {27278#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27274#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {27282#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27278#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {27286#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27282#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {27290#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27286#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {27294#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27290#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {27298#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27294#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {27302#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27298#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {27306#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27302#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {27310#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27306#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {27314#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27310#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {27318#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27314#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {27322#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27318#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {27326#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27322#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {27330#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27326#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {27334#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27330#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {27338#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27334#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {27342#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27338#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {27346#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27342#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {27350#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27346#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {27354#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27350#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {27358#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27354#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {27362#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27358#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {27366#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27362#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {27370#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27366#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {27374#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27370#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {27378#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27374#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {27382#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27378#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {27386#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27382#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {27390#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27386#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {27394#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27390#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {27398#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27394#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {27402#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27398#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {27406#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27402#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {26961#true} ~x~0 := 0; {27406#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:35,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {26961#true} call #t~ret4 := main(); {26961#true} is VALID [2022-04-15 06:05:35,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26961#true} {26961#true} #34#return; {26961#true} is VALID [2022-04-15 06:05:35,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {26961#true} assume true; {26961#true} is VALID [2022-04-15 06:05:35,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {26961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26961#true} is VALID [2022-04-15 06:05:35,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {26961#true} call ULTIMATE.init(); {26961#true} is VALID [2022-04-15 06:05:35,249 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-15 06:05:35,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689404312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:35,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:35,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-15 06:05:35,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:35,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [386317514] [2022-04-15 06:05:35,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [386317514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:35,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:35,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 06:05:35,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550047877] [2022-04-15 06:05:35,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:35,250 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 06:05:35,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:35,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:35,295 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-15 06:05:35,295 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 06:05:35,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:35,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 06:05:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2805, Invalid=7907, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 06:05:35,297 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:41,060 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-15 06:05:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 06:05:41,060 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 06:05:41,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-15 06:05:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-15 06:05:41,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-15 06:05:41,111 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-15 06:05:41,112 INFO L225 Difference]: With dead ends: 67 [2022-04-15 06:05:41,112 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 06:05:41,113 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5603, Invalid=17959, Unknown=0, NotChecked=0, Total=23562 [2022-04-15 06:05:41,113 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:41,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 213 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 06:05:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 06:05:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-15 06:05:41,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:41,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:41,187 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:41,187 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:41,188 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 06:05:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 06:05:41,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:41,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:41,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 06:05:41,188 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 06:05:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:41,189 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 06:05:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 06:05:41,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:41,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:41,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:41,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:41,190 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-15 06:05:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2022-04-15 06:05:41,190 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2022-04-15 06:05:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:41,191 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2022-04-15 06:05:41,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:41,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 62 transitions. [2022-04-15 06:05:41,261 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-15 06:05:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 06:05:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 06:05:41,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:41,262 INFO L499 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:41,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2022-04-15 06:05:41,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2022-04-15 06:05:41,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98,SelfDestructingSolverStorable99,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:41,662 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:41,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1206070556, now seen corresponding path program 99 times [2022-04-15 06:05:41,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:41,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1351777434] [2022-04-15 06:05:41,811 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:05:41,813 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:05:41,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1028854071, now seen corresponding path program 1 times [2022-04-15 06:05:41,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:41,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983051016] [2022-04-15 06:05:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:41,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:41,819 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_50.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_50.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:05:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:05:41,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050193508] [2022-04-15 06:05:41,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:41,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:41,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:41,822 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:05:41,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-04-15 06:05:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:41,868 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:05:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:41,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:05:41,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1206070556, now seen corresponding path program 100 times [2022-04-15 06:05:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:41,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885849366] [2022-04-15 06:05:41,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:43,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:43,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {27965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27909#true} is VALID [2022-04-15 06:05:43,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-04-15 06:05:43,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27909#true} {27909#true} #34#return; {27909#true} is VALID [2022-04-15 06:05:43,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {27909#true} call ULTIMATE.init(); {27965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:43,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {27965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27909#true} is VALID [2022-04-15 06:05:43,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-04-15 06:05:43,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27909#true} {27909#true} #34#return; {27909#true} is VALID [2022-04-15 06:05:43,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {27909#true} call #t~ret4 := main(); {27909#true} is VALID [2022-04-15 06:05:43,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {27909#true} ~x~0 := 0; {27914#(= main_~x~0 0)} is VALID [2022-04-15 06:05:43,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {27914#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:05:43,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {27915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27916#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:05:43,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {27916#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27917#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:05:43,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {27917#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:05:43,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {27918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:05:43,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {27919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:05:43,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {27920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27921#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:05:43,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {27921#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:05:43,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {27922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:05:43,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {27923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27924#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:05:43,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {27924#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27925#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:05:43,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {27925#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27926#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:05:43,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {27926#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27927#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:05:43,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {27927#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27928#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:05:43,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {27928#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27929#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:05:43,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {27929#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27930#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:05:43,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {27930#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27931#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:05:43,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {27931#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27932#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:05:43,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {27932#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27933#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:05:43,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {27933#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27934#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:05:43,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {27934#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27935#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:05:43,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {27935#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27936#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:05:43,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {27936#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27937#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:05:43,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {27937#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27938#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:05:43,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {27938#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27939#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:05:43,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {27939#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27940#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:05:43,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {27940#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27941#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:05:43,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {27941#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27942#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:05:43,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {27942#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27943#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:05:43,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {27943#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27944#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:05:43,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {27944#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27945#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:05:43,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {27945#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27946#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:05:43,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {27946#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27947#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:05:43,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {27947#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27948#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:05:43,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {27948#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27949#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:05:43,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {27949#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27950#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:05:43,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {27950#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27951#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:05:43,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {27951#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27952#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:05:43,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {27952#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27953#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:05:43,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {27953#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27954#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:05:43,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {27954#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27955#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:05:43,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {27955#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27956#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:05:43,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {27956#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27957#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:05:43,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {27957#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27958#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:05:43,322 INFO L290 TraceCheckUtils]: 50: Hoare triple {27958#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27959#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:05:43,323 INFO L290 TraceCheckUtils]: 51: Hoare triple {27959#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27960#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:05:43,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {27960#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27961#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:05:43,324 INFO L290 TraceCheckUtils]: 53: Hoare triple {27961#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27962#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:05:43,324 INFO L290 TraceCheckUtils]: 54: Hoare triple {27962#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27963#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:05:43,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {27963#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27964#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 100))} is VALID [2022-04-15 06:05:43,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {27964#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 100))} assume !(~x~0 % 4294967296 < 268435455); {27910#false} is VALID [2022-04-15 06:05:43,325 INFO L272 TraceCheckUtils]: 57: Hoare triple {27910#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {27910#false} is VALID [2022-04-15 06:05:43,325 INFO L290 TraceCheckUtils]: 58: Hoare triple {27910#false} ~cond := #in~cond; {27910#false} is VALID [2022-04-15 06:05:43,325 INFO L290 TraceCheckUtils]: 59: Hoare triple {27910#false} assume 0 == ~cond; {27910#false} is VALID [2022-04-15 06:05:43,325 INFO L290 TraceCheckUtils]: 60: Hoare triple {27910#false} assume !false; {27910#false} is VALID [2022-04-15 06:05:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:05:43,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:43,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885849366] [2022-04-15 06:05:43,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885849366] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:43,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378557380] [2022-04-15 06:05:43,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:05:43,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:43,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:43,327 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:05:43,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-04-15 06:05:43,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:05:43,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:43,459 WARN L261 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 103 conjunts are in the unsatisfiable core [2022-04-15 06:05:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:43,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:44,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {27909#true} call ULTIMATE.init(); {27909#true} is VALID [2022-04-15 06:05:44,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27909#true} is VALID [2022-04-15 06:05:44,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-04-15 06:05:44,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27909#true} {27909#true} #34#return; {27909#true} is VALID [2022-04-15 06:05:44,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {27909#true} call #t~ret4 := main(); {27909#true} is VALID [2022-04-15 06:05:44,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {27909#true} ~x~0 := 0; {27914#(= main_~x~0 0)} is VALID [2022-04-15 06:05:44,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {27914#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:05:44,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {27915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27916#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:05:44,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {27916#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27917#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:05:44,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {27917#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:05:44,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {27918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:05:44,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {27919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:05:44,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {27920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27921#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:05:44,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {27921#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:05:44,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {27922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:05:44,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {27923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27924#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:05:44,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {27924#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27925#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:05:44,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {27925#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27926#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:05:44,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {27926#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27927#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:05:44,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {27927#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27928#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:05:44,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {27928#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27929#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:05:44,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {27929#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27930#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:05:44,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {27930#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27931#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:05:44,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {27931#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27932#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:05:44,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {27932#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27933#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:05:44,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {27933#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27934#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:05:44,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {27934#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27935#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:05:44,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {27935#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27936#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:05:44,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {27936#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27937#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:05:44,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {27937#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27938#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:05:44,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {27938#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27939#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:05:44,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {27939#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27940#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:05:44,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {27940#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27941#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:05:44,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {27941#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27942#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:05:44,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {27942#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27943#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:05:44,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {27943#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27944#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:05:44,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {27944#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27945#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:05:44,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {27945#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27946#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:05:44,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {27946#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27947#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:05:44,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {27947#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27948#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:05:44,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {27948#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27949#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:05:44,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {27949#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27950#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:05:44,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {27950#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27951#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:05:44,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {27951#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27952#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:05:44,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {27952#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27953#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:05:44,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {27953#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27954#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:05:44,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {27954#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27955#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:05:44,100 INFO L290 TraceCheckUtils]: 47: Hoare triple {27955#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27956#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:05:44,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {27956#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27957#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:05:44,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {27957#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27958#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:05:44,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {27958#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27959#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:05:44,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {27959#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27960#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:05:44,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {27960#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27961#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:05:44,103 INFO L290 TraceCheckUtils]: 53: Hoare triple {27961#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27962#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:05:44,104 INFO L290 TraceCheckUtils]: 54: Hoare triple {27962#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27963#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:05:44,104 INFO L290 TraceCheckUtils]: 55: Hoare triple {27963#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28134#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:05:44,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {28134#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !(~x~0 % 4294967296 < 268435455); {27910#false} is VALID [2022-04-15 06:05:44,105 INFO L272 TraceCheckUtils]: 57: Hoare triple {27910#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {27910#false} is VALID [2022-04-15 06:05:44,105 INFO L290 TraceCheckUtils]: 58: Hoare triple {27910#false} ~cond := #in~cond; {27910#false} is VALID [2022-04-15 06:05:44,105 INFO L290 TraceCheckUtils]: 59: Hoare triple {27910#false} assume 0 == ~cond; {27910#false} is VALID [2022-04-15 06:05:44,105 INFO L290 TraceCheckUtils]: 60: Hoare triple {27910#false} assume !false; {27910#false} is VALID [2022-04-15 06:05:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:05:44,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:48,233 INFO L290 TraceCheckUtils]: 60: Hoare triple {27910#false} assume !false; {27910#false} is VALID [2022-04-15 06:05:48,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {27910#false} assume 0 == ~cond; {27910#false} is VALID [2022-04-15 06:05:48,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {27910#false} ~cond := #in~cond; {27910#false} is VALID [2022-04-15 06:05:48,234 INFO L272 TraceCheckUtils]: 57: Hoare triple {27910#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {27910#false} is VALID [2022-04-15 06:05:48,234 INFO L290 TraceCheckUtils]: 56: Hoare triple {28162#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {27910#false} is VALID [2022-04-15 06:05:48,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {28166#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28162#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {28170#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28166#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {28174#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28170#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {28178#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28174#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {28182#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28178#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {28186#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28182#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {28190#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28186#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {28194#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28190#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {28198#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28194#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {28202#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28198#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {28206#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28202#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {28210#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28206#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {28214#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28210#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {28218#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28214#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {28222#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28218#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {28226#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28222#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {28230#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28226#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {28234#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28230#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {28238#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28234#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {28242#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28238#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {28246#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28242#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {28250#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28246#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {28254#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28250#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {28258#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28254#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {28262#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28258#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {28266#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28262#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {28270#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28266#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {28274#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28270#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {28278#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28274#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {28282#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28278#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {28286#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28282#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {28290#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28286#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {28294#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28290#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {28298#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28294#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {28302#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28298#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {28306#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28302#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {28310#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28306#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {28314#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28310#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {28318#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28314#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {28322#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28318#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {28326#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28322#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {28330#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28326#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {28334#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28330#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {28338#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28334#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {28342#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28338#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {28346#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28342#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {28350#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28346#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {28354#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28350#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {28358#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28354#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {28362#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28358#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {27909#true} ~x~0 := 0; {28362#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:05:48,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {27909#true} call #t~ret4 := main(); {27909#true} is VALID [2022-04-15 06:05:48,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27909#true} {27909#true} #34#return; {27909#true} is VALID [2022-04-15 06:05:48,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-04-15 06:05:48,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27909#true} is VALID [2022-04-15 06:05:48,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {27909#true} call ULTIMATE.init(); {27909#true} is VALID [2022-04-15 06:05:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:05:48,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378557380] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:48,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:48,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 106 [2022-04-15 06:05:48,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:48,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1351777434] [2022-04-15 06:05:48,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1351777434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:48,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:48,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 06:05:48,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162618939] [2022-04-15 06:05:48,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:48,268 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 06:05:48,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:48,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:48,317 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-15 06:05:48,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 06:05:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:48,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 06:05:48,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2912, Invalid=8218, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 06:05:48,319 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:53,786 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 06:05:53,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 06:05:53,786 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 06:05:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-15 06:05:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-15 06:05:53,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 68 transitions. [2022-04-15 06:05:53,830 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-15 06:05:53,831 INFO L225 Difference]: With dead ends: 68 [2022-04-15 06:05:53,831 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 06:05:53,833 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1381 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5817, Invalid=18675, Unknown=0, NotChecked=0, Total=24492 [2022-04-15 06:05:53,833 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2722 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:53,833 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2722 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 06:05:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 06:05:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 06:05:53,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:53,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:53,909 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:53,909 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:53,910 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-15 06:05:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 06:05:53,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:53,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:53,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 06:05:53,911 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 06:05:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:53,911 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-15 06:05:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 06:05:53,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:53,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:53,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:53,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-15 06:05:53,912 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2022-04-15 06:05:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:53,912 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-15 06:05:53,912 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:05:53,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-15 06:05:53,959 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-15 06:05:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 06:05:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 06:05:53,960 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:53,960 INFO L499 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:53,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-04-15 06:05:54,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2022-04-15 06:05:54,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:54,360 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:54,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1230057162, now seen corresponding path program 101 times [2022-04-15 06:05:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:54,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12694303] [2022-04-15 06:05:54,516 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:05:54,518 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:05:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1087959415, now seen corresponding path program 1 times [2022-04-15 06:05:54,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:54,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111700755] [2022-04-15 06:05:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:54,523 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_51.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_51.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:05:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:05:54,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424808284] [2022-04-15 06:05:54,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:54,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:54,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:54,527 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:05:54,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-04-15 06:05:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:54,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:05:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:54,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:05:54,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1230057162, now seen corresponding path program 102 times [2022-04-15 06:05:54,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:54,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798945772] [2022-04-15 06:05:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:54,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:55,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:56,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {28930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28873#true} is VALID [2022-04-15 06:05:56,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {28873#true} assume true; {28873#true} is VALID [2022-04-15 06:05:56,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28873#true} {28873#true} #34#return; {28873#true} is VALID [2022-04-15 06:05:56,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {28873#true} call ULTIMATE.init(); {28930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:56,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {28930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28873#true} is VALID [2022-04-15 06:05:56,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {28873#true} assume true; {28873#true} is VALID [2022-04-15 06:05:56,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28873#true} {28873#true} #34#return; {28873#true} is VALID [2022-04-15 06:05:56,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {28873#true} call #t~ret4 := main(); {28873#true} is VALID [2022-04-15 06:05:56,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {28873#true} ~x~0 := 0; {28878#(= main_~x~0 0)} is VALID [2022-04-15 06:05:56,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {28878#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:05:56,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {28879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:05:56,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {28880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:05:56,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {28881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:05:56,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {28882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:05:56,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {28883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:05:56,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {28884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:05:56,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {28885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:05:56,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {28886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:05:56,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {28887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:05:56,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {28888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:05:56,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {28889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:05:56,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {28890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:05:56,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {28891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:05:56,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {28892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:05:56,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {28893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:05:56,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {28894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:05:56,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {28895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:05:56,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {28896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:05:56,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {28897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:05:56,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {28898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:05:56,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {28899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:05:56,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {28900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:05:56,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {28901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:05:56,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {28902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:05:56,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {28903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:05:56,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {28904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:05:56,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {28905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:05:56,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {28906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:05:56,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {28907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:05:56,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {28908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:05:56,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {28909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:05:56,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {28910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:05:56,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {28911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:05:56,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {28912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:05:56,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {28913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:05:56,024 INFO L290 TraceCheckUtils]: 42: Hoare triple {28914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:05:56,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {28915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:05:56,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {28916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:05:56,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {28917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:05:56,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {28918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:05:56,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {28919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:05:56,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {28920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:05:56,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {28921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:05:56,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {28922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:05:56,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {28923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:05:56,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {28924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:05:56,029 INFO L290 TraceCheckUtils]: 53: Hoare triple {28925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:05:56,029 INFO L290 TraceCheckUtils]: 54: Hoare triple {28926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:05:56,030 INFO L290 TraceCheckUtils]: 55: Hoare triple {28927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:05:56,030 INFO L290 TraceCheckUtils]: 56: Hoare triple {28928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28929#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 102))} is VALID [2022-04-15 06:05:56,031 INFO L290 TraceCheckUtils]: 57: Hoare triple {28929#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 102))} assume !(~x~0 % 4294967296 < 268435455); {28874#false} is VALID [2022-04-15 06:05:56,031 INFO L272 TraceCheckUtils]: 58: Hoare triple {28874#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {28874#false} is VALID [2022-04-15 06:05:56,031 INFO L290 TraceCheckUtils]: 59: Hoare triple {28874#false} ~cond := #in~cond; {28874#false} is VALID [2022-04-15 06:05:56,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {28874#false} assume 0 == ~cond; {28874#false} is VALID [2022-04-15 06:05:56,031 INFO L290 TraceCheckUtils]: 61: Hoare triple {28874#false} assume !false; {28874#false} is VALID [2022-04-15 06:05:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:05:56,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:56,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798945772] [2022-04-15 06:05:56,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798945772] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:56,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166782110] [2022-04-15 06:05:56,032 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:05:56,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:56,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:56,034 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:05:56,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-04-15 06:05:59,152 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2022-04-15 06:05:59,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:59,159 WARN L261 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-15 06:05:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:59,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:59,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {28873#true} call ULTIMATE.init(); {28873#true} is VALID [2022-04-15 06:05:59,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {28873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28873#true} is VALID [2022-04-15 06:05:59,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {28873#true} assume true; {28873#true} is VALID [2022-04-15 06:05:59,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28873#true} {28873#true} #34#return; {28873#true} is VALID [2022-04-15 06:05:59,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {28873#true} call #t~ret4 := main(); {28873#true} is VALID [2022-04-15 06:05:59,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {28873#true} ~x~0 := 0; {28878#(= main_~x~0 0)} is VALID [2022-04-15 06:05:59,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {28878#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:05:59,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {28879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:05:59,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {28880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:05:59,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {28881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:05:59,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {28882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:05:59,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {28883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:05:59,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {28884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:05:59,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {28885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:05:59,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {28886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:05:59,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {28887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:05:59,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {28888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:05:59,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {28889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:05:59,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {28890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:05:59,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {28891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:05:59,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {28892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:05:59,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {28893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:05:59,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {28894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:05:59,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {28895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:05:59,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {28896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:05:59,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {28897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:05:59,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {28898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:05:59,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {28899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:05:59,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {28900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:05:59,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {28901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:05:59,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {28902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:05:59,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {28903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:05:59,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {28904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:05:59,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {28905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:05:59,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {28906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:05:59,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {28907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:05:59,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {28908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:05:59,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {28909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:05:59,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {28910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:05:59,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {28911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:05:59,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {28912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:05:59,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {28913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:05:59,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {28914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:05:59,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {28915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:05:59,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {28916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:05:59,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {28917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:05:59,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {28918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:05:59,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {28919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:05:59,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {28920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:05:59,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {28921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:05:59,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {28922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:05:59,707 INFO L290 TraceCheckUtils]: 51: Hoare triple {28923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:05:59,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {28924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:05:59,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {28925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:05:59,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {28926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:05:59,709 INFO L290 TraceCheckUtils]: 55: Hoare triple {28927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:05:59,710 INFO L290 TraceCheckUtils]: 56: Hoare triple {28928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29102#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:05:59,710 INFO L290 TraceCheckUtils]: 57: Hoare triple {29102#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {28874#false} is VALID [2022-04-15 06:05:59,710 INFO L272 TraceCheckUtils]: 58: Hoare triple {28874#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {28874#false} is VALID [2022-04-15 06:05:59,710 INFO L290 TraceCheckUtils]: 59: Hoare triple {28874#false} ~cond := #in~cond; {28874#false} is VALID [2022-04-15 06:05:59,710 INFO L290 TraceCheckUtils]: 60: Hoare triple {28874#false} assume 0 == ~cond; {28874#false} is VALID [2022-04-15 06:05:59,710 INFO L290 TraceCheckUtils]: 61: Hoare triple {28874#false} assume !false; {28874#false} is VALID [2022-04-15 06:05:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:05:59,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:05,412 INFO L290 TraceCheckUtils]: 61: Hoare triple {28874#false} assume !false; {28874#false} is VALID [2022-04-15 06:06:05,412 INFO L290 TraceCheckUtils]: 60: Hoare triple {29121#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28874#false} is VALID [2022-04-15 06:06:05,413 INFO L290 TraceCheckUtils]: 59: Hoare triple {29125#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29121#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:06:05,413 INFO L272 TraceCheckUtils]: 58: Hoare triple {29129#(< 0 (mod 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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {29125#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:06:05,414 INFO L290 TraceCheckUtils]: 57: Hoare triple {29133#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {29129#(< 0 (mod main_~x~0 2))} is VALID [2022-04-15 06:06:05,415 INFO L290 TraceCheckUtils]: 56: Hoare triple {29137#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29133#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,415 INFO L290 TraceCheckUtils]: 55: Hoare triple {29141#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29137#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,416 INFO L290 TraceCheckUtils]: 54: Hoare triple {29145#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29141#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {29149#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29145#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,418 INFO L290 TraceCheckUtils]: 52: Hoare triple {29153#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29149#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {29157#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29153#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {29161#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29157#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {29165#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29161#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {29169#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29165#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {29173#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29169#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {29177#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29173#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {29181#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29177#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {29185#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29181#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {29189#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29185#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {29193#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29189#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {29197#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29193#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {29201#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29197#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {29205#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29201#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {29209#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29205#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {29213#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29209#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {29217#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29213#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} is VALID [2022-04-15 06:06:05,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {29221#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29217#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {29225#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29221#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {29229#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29225#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {29233#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29229#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {29237#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29233#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {29241#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29237#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {29245#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29241#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {29249#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29245#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {29253#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29249#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {29257#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29253#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {29261#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29257#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {29265#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29261#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {29269#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29265#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {29273#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29269#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {29277#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29273#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {29281#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29277#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {29285#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29281#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {29289#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 78) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29285#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {29293#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29289#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 78) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {29297#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 82) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29293#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {29301#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 84 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29297#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 82) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {29305#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 86) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29301#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 84 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {29309#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 88 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29305#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 86) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {29313#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29309#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 88 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {29317#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29313#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {29321#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 94 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29317#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {29325#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29321#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 94 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {29329#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29325#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {29333#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29329#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {29337#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 102) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29333#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {28873#true} ~x~0 := 0; {29337#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 102) 4294967296) 268435455))} is VALID [2022-04-15 06:06:05,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {28873#true} call #t~ret4 := main(); {28873#true} is VALID [2022-04-15 06:06:05,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28873#true} {28873#true} #34#return; {28873#true} is VALID [2022-04-15 06:06:05,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {28873#true} assume true; {28873#true} is VALID [2022-04-15 06:06:05,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {28873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28873#true} is VALID [2022-04-15 06:06:05,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {28873#true} call ULTIMATE.init(); {28873#true} is VALID [2022-04-15 06:06:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:06:05,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166782110] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:05,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:05,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 57] total 111 [2022-04-15 06:06:05,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:05,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12694303] [2022-04-15 06:06:05,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12694303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:05,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:05,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 06:06:05,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065931015] [2022-04-15 06:06:05,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 06:06:05,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:05,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:05,582 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-15 06:06:05,582 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 06:06:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:05,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 06:06:05,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=9131, Unknown=0, NotChecked=0, Total=12210 [2022-04-15 06:06:05,584 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:10,997 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-15 06:06:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 06:06:10,997 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 06:06:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-15 06:06:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-15 06:06:10,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-15 06:06:11,053 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-15 06:06:11,054 INFO L225 Difference]: With dead ends: 69 [2022-04-15 06:06:11,054 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 06:06:11,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=6093, Invalid=20313, Unknown=0, NotChecked=0, Total=26406 [2022-04-15 06:06:11,055 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:11,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 06:06:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 06:06:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-15 06:06:11,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:11,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:11,129 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:11,129 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:11,130 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 06:06:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 06:06:11,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:11,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:11,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 06:06:11,131 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 06:06:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:11,131 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 06:06:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 06:06:11,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:11,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:11,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:11,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:11,132 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-15 06:06:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2022-04-15 06:06:11,133 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2022-04-15 06:06:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:11,133 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2022-04-15 06:06:11,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:11,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 64 transitions. [2022-04-15 06:06:11,194 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-15 06:06:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 06:06:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 06:06:11,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:11,195 INFO L499 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:11,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-04-15 06:06:11,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2022-04-15 06:06:11,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103 [2022-04-15 06:06:11,596 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:11,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash 559394908, now seen corresponding path program 103 times [2022-04-15 06:06:11,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:11,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [353919052] [2022-04-15 06:06:13,670 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:06:13,768 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:06:13,770 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:06:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1147064759, now seen corresponding path program 1 times [2022-04-15 06:06:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:13,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161601795] [2022-04-15 06:06:13,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:13,775 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_52.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_52.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:06:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:06:13,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953565026] [2022-04-15 06:06:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:13,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:13,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:13,784 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:06:13,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-04-15 06:06:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:13,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:06:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:13,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:06:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash 559394908, now seen corresponding path program 104 times [2022-04-15 06:06:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:13,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858762386] [2022-04-15 06:06:13,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:15,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:15,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {29914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29856#true} is VALID [2022-04-15 06:06:15,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {29856#true} assume true; {29856#true} is VALID [2022-04-15 06:06:15,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29856#true} {29856#true} #34#return; {29856#true} is VALID [2022-04-15 06:06:15,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {29856#true} call ULTIMATE.init(); {29914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:15,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {29914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29856#true} is VALID [2022-04-15 06:06:15,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {29856#true} assume true; {29856#true} is VALID [2022-04-15 06:06:15,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29856#true} {29856#true} #34#return; {29856#true} is VALID [2022-04-15 06:06:15,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {29856#true} call #t~ret4 := main(); {29856#true} is VALID [2022-04-15 06:06:15,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {29856#true} ~x~0 := 0; {29861#(= main_~x~0 0)} is VALID [2022-04-15 06:06:15,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {29861#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:06:15,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {29862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29863#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:06:15,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {29863#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29864#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:06:15,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {29864#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29865#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:06:15,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {29865#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29866#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:06:15,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {29866#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:06:15,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {29867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:06:15,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {29868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29869#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:06:15,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {29869#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29870#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:06:15,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {29870#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29871#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:06:15,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {29871#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29872#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:06:15,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {29872#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29873#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:06:15,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {29873#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29874#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:06:15,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {29874#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29875#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:06:15,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {29875#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29876#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:06:15,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {29876#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29877#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:06:15,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {29877#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29878#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:06:15,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {29878#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29879#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:06:15,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {29879#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29880#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:06:15,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {29880#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29881#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:06:15,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {29881#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29882#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:06:15,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {29882#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29883#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:06:15,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {29883#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29884#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:06:15,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {29884#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29885#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:06:15,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {29885#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29886#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:06:15,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {29886#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29887#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:06:15,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {29887#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29888#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:06:15,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {29888#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29889#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:06:15,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {29889#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29890#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:06:15,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {29890#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29891#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:06:15,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {29891#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29892#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:06:15,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {29892#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29893#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:06:15,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {29893#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29894#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:06:15,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {29894#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29895#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:06:15,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {29895#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29896#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:06:15,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {29896#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29897#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:06:15,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {29897#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29898#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:06:15,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {29898#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29899#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:06:15,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {29899#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29900#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:06:15,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {29900#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29901#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:06:15,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {29901#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29902#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:06:15,333 INFO L290 TraceCheckUtils]: 47: Hoare triple {29902#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29903#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:06:15,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {29903#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29904#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:06:15,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {29904#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29905#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:06:15,334 INFO L290 TraceCheckUtils]: 50: Hoare triple {29905#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29906#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:06:15,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {29906#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29907#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:06:15,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {29907#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29908#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:06:15,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {29908#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29909#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:06:15,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {29909#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29910#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:06:15,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {29910#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29911#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:06:15,337 INFO L290 TraceCheckUtils]: 56: Hoare triple {29911#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29912#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:06:15,337 INFO L290 TraceCheckUtils]: 57: Hoare triple {29912#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29913#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 104))} is VALID [2022-04-15 06:06:15,338 INFO L290 TraceCheckUtils]: 58: Hoare triple {29913#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 104))} assume !(~x~0 % 4294967296 < 268435455); {29857#false} is VALID [2022-04-15 06:06:15,338 INFO L272 TraceCheckUtils]: 59: Hoare triple {29857#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {29857#false} is VALID [2022-04-15 06:06:15,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {29857#false} ~cond := #in~cond; {29857#false} is VALID [2022-04-15 06:06:15,338 INFO L290 TraceCheckUtils]: 61: Hoare triple {29857#false} assume 0 == ~cond; {29857#false} is VALID [2022-04-15 06:06:15,338 INFO L290 TraceCheckUtils]: 62: Hoare triple {29857#false} assume !false; {29857#false} is VALID [2022-04-15 06:06:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:06:15,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:15,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858762386] [2022-04-15 06:06:15,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858762386] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:15,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184256812] [2022-04-15 06:06:15,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:06:15,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:15,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:15,340 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:06:15,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-04-15 06:06:15,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:06:15,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:15,464 WARN L261 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 107 conjunts are in the unsatisfiable core [2022-04-15 06:06:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:15,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:16,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {29856#true} call ULTIMATE.init(); {29856#true} is VALID [2022-04-15 06:06:16,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {29856#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29856#true} is VALID [2022-04-15 06:06:16,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {29856#true} assume true; {29856#true} is VALID [2022-04-15 06:06:16,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29856#true} {29856#true} #34#return; {29856#true} is VALID [2022-04-15 06:06:16,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {29856#true} call #t~ret4 := main(); {29856#true} is VALID [2022-04-15 06:06:16,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {29856#true} ~x~0 := 0; {29861#(= main_~x~0 0)} is VALID [2022-04-15 06:06:16,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {29861#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:06:16,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {29862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29863#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:06:16,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {29863#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29864#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:06:16,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {29864#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29865#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:06:16,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {29865#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29866#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:06:16,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {29866#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:06:16,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {29867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:06:16,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {29868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29869#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:06:16,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {29869#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29870#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:06:16,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {29870#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29871#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:06:16,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {29871#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29872#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:06:16,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {29872#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29873#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:06:16,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {29873#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29874#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:06:16,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {29874#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29875#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:06:16,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {29875#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29876#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:06:16,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {29876#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29877#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:06:16,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {29877#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29878#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:06:16,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {29878#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29879#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:06:16,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {29879#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29880#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:06:16,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {29880#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29881#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:06:16,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {29881#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29882#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:06:16,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {29882#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29883#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:06:16,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {29883#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29884#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:06:16,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {29884#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29885#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:06:16,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {29885#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29886#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:06:16,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {29886#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29887#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:06:16,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {29887#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29888#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:06:16,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {29888#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29889#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:06:16,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {29889#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29890#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:06:16,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {29890#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29891#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:06:16,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {29891#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29892#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:06:16,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {29892#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29893#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:06:16,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {29893#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29894#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:06:16,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {29894#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29895#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:06:16,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {29895#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29896#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:06:16,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {29896#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29897#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:06:16,117 INFO L290 TraceCheckUtils]: 42: Hoare triple {29897#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29898#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:06:16,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {29898#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29899#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:06:16,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {29899#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29900#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:06:16,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {29900#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29901#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:06:16,119 INFO L290 TraceCheckUtils]: 46: Hoare triple {29901#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29902#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:06:16,120 INFO L290 TraceCheckUtils]: 47: Hoare triple {29902#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29903#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:06:16,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {29903#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29904#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:06:16,120 INFO L290 TraceCheckUtils]: 49: Hoare triple {29904#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29905#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:06:16,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {29905#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29906#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:06:16,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {29906#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29907#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:06:16,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {29907#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29908#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:06:16,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {29908#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29909#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:06:16,123 INFO L290 TraceCheckUtils]: 54: Hoare triple {29909#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29910#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:06:16,123 INFO L290 TraceCheckUtils]: 55: Hoare triple {29910#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29911#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:06:16,124 INFO L290 TraceCheckUtils]: 56: Hoare triple {29911#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29912#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:06:16,124 INFO L290 TraceCheckUtils]: 57: Hoare triple {29912#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30089#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:06:16,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {30089#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {29857#false} is VALID [2022-04-15 06:06:16,125 INFO L272 TraceCheckUtils]: 59: Hoare triple {29857#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {29857#false} is VALID [2022-04-15 06:06:16,125 INFO L290 TraceCheckUtils]: 60: Hoare triple {29857#false} ~cond := #in~cond; {29857#false} is VALID [2022-04-15 06:06:16,125 INFO L290 TraceCheckUtils]: 61: Hoare triple {29857#false} assume 0 == ~cond; {29857#false} is VALID [2022-04-15 06:06:16,125 INFO L290 TraceCheckUtils]: 62: Hoare triple {29857#false} assume !false; {29857#false} is VALID [2022-04-15 06:06:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:06:16,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:20,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {29857#false} assume !false; {29857#false} is VALID [2022-04-15 06:06:20,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {29857#false} assume 0 == ~cond; {29857#false} is VALID [2022-04-15 06:06:20,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {29857#false} ~cond := #in~cond; {29857#false} is VALID [2022-04-15 06:06:20,516 INFO L272 TraceCheckUtils]: 59: Hoare triple {29857#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {29857#false} is VALID [2022-04-15 06:06:20,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {30117#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {29857#false} is VALID [2022-04-15 06:06:20,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {30121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30117#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {30125#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {30129#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30125#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {30133#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30129#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {30137#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30133#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {30141#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30137#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,521 INFO L290 TraceCheckUtils]: 51: Hoare triple {30145#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30141#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {30149#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30145#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {30153#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30149#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {30157#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30153#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {30161#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30157#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,524 INFO L290 TraceCheckUtils]: 46: Hoare triple {30165#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30161#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {30169#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30165#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {30173#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30169#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {30177#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30173#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {30181#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30177#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {30185#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30181#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {30189#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30185#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {30193#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30189#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {30197#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30193#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {30201#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30197#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {30205#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30201#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {30209#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30205#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {30213#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30209#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {30217#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30213#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {30221#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30217#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {30225#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30221#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {30229#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30225#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {30233#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30229#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {30237#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30233#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {30241#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30237#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {30245#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30241#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {30249#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30245#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {30253#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30249#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {30257#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30253#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {30261#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30257#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {30265#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30261#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {30269#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30265#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {30273#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30269#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {30277#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30273#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {30281#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30277#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {30285#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30281#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {30289#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30285#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {30293#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30289#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {30297#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30293#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {30301#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30297#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {30305#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30301#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {30309#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30305#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {30313#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30309#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {30317#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30313#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {30321#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30317#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {30325#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30321#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {29856#true} ~x~0 := 0; {30325#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:20,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {29856#true} call #t~ret4 := main(); {29856#true} is VALID [2022-04-15 06:06:20,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29856#true} {29856#true} #34#return; {29856#true} is VALID [2022-04-15 06:06:20,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {29856#true} assume true; {29856#true} is VALID [2022-04-15 06:06:20,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {29856#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29856#true} is VALID [2022-04-15 06:06:20,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {29856#true} call ULTIMATE.init(); {29856#true} is VALID [2022-04-15 06:06:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:06:20,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184256812] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:20,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:20,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 110 [2022-04-15 06:06:20,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:20,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [353919052] [2022-04-15 06:06:20,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [353919052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:20,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:20,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 06:06:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438376035] [2022-04-15 06:06:20,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:20,557 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 06:06:20,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:20,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:20,592 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-15 06:06:20,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 06:06:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 06:06:20,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3132, Invalid=8858, Unknown=0, NotChecked=0, Total=11990 [2022-04-15 06:06:20,593 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:26,261 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 06:06:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 06:06:26,261 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 06:06:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-15 06:06:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-15 06:06:26,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-15 06:06:26,324 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-15 06:06:26,325 INFO L225 Difference]: With dead ends: 70 [2022-04-15 06:06:26,325 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 06:06:26,327 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=6257, Invalid=20149, Unknown=0, NotChecked=0, Total=26406 [2022-04-15 06:06:26,327 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:26,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 06:06:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 06:06:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 06:06:26,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:26,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:26,415 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:26,415 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:26,415 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-15 06:06:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-15 06:06:26,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:26,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:26,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:06:26,416 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:06:26,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:26,416 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-15 06:06:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-15 06:06:26,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:26,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:26,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:26,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-04-15 06:06:26,418 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2022-04-15 06:06:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:26,418 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-04-15 06:06:26,418 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:26,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 65 transitions. [2022-04-15 06:06:26,478 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-15 06:06:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-15 06:06:26,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 06:06:26,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:26,478 INFO L499 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:26,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-04-15 06:06:26,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2022-04-15 06:06:26,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,SelfDestructingSolverStorable105,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:26,879 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:26,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 197834230, now seen corresponding path program 105 times [2022-04-15 06:06:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:26,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1344874130] [2022-04-15 06:06:29,094 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:06:29,096 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:06:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1206170103, now seen corresponding path program 1 times [2022-04-15 06:06:29,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:29,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152393292] [2022-04-15 06:06:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:29,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:29,101 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_53.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_53.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 06:06:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:06:29,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2038903348] [2022-04-15 06:06:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:29,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:29,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:29,105 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:06:29,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-04-15 06:06:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:29,153 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:06:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:29,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:06:29,162 INFO L85 PathProgramCache]: Analyzing trace with hash 197834230, now seen corresponding path program 106 times [2022-04-15 06:06:29,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:29,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864077879] [2022-04-15 06:06:29,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:29,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:30,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:30,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {30911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30852#true} is VALID [2022-04-15 06:06:30,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {30852#true} assume true; {30852#true} is VALID [2022-04-15 06:06:30,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30852#true} {30852#true} #34#return; {30852#true} is VALID [2022-04-15 06:06:30,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {30852#true} call ULTIMATE.init(); {30911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:30,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {30911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30852#true} is VALID [2022-04-15 06:06:30,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {30852#true} assume true; {30852#true} is VALID [2022-04-15 06:06:30,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30852#true} {30852#true} #34#return; {30852#true} is VALID [2022-04-15 06:06:30,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {30852#true} call #t~ret4 := main(); {30852#true} is VALID [2022-04-15 06:06:30,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {30852#true} ~x~0 := 0; {30857#(= main_~x~0 0)} is VALID [2022-04-15 06:06:30,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {30857#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30858#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:06:30,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {30858#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:06:30,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {30859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:06:30,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {30860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30861#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:06:30,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {30861#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30862#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:06:30,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {30862#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30863#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:06:30,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {30863#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:06:30,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {30864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30865#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:06:30,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {30865#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30866#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:06:30,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {30866#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:06:30,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {30867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30868#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:06:30,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {30868#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30869#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:06:30,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {30869#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30870#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:06:30,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {30870#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30871#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:06:30,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {30871#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30872#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:06:30,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {30872#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30873#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:06:30,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {30873#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30874#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:06:30,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {30874#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30875#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:06:30,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {30875#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30876#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:06:30,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {30876#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30877#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:06:30,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {30877#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30878#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:06:30,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {30878#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30879#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:06:30,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {30879#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30880#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:06:30,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {30880#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30881#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:06:30,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {30881#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30882#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:06:30,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {30882#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30883#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:06:30,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {30883#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30884#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:06:30,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {30884#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30885#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:06:30,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {30885#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30886#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:06:30,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {30886#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30887#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:06:30,786 INFO L290 TraceCheckUtils]: 36: Hoare triple {30887#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30888#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:06:30,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {30888#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30889#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:06:30,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {30889#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30890#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:06:30,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {30890#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30891#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:06:30,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {30891#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30892#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:06:30,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {30892#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30893#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:06:30,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {30893#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30894#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:06:30,790 INFO L290 TraceCheckUtils]: 43: Hoare triple {30894#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30895#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:06:30,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {30895#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30896#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:06:30,791 INFO L290 TraceCheckUtils]: 45: Hoare triple {30896#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30897#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:06:30,791 INFO L290 TraceCheckUtils]: 46: Hoare triple {30897#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30898#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:06:30,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {30898#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30899#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:06:30,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {30899#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30900#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:06:30,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {30900#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30901#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:06:30,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {30901#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30902#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:06:30,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {30902#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30903#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:06:30,794 INFO L290 TraceCheckUtils]: 52: Hoare triple {30903#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30904#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:06:30,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {30904#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30905#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:06:30,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {30905#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30906#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:06:30,796 INFO L290 TraceCheckUtils]: 55: Hoare triple {30906#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30907#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:06:30,796 INFO L290 TraceCheckUtils]: 56: Hoare triple {30907#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30908#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:06:30,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {30908#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30909#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:06:30,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {30909#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30910#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 106))} is VALID [2022-04-15 06:06:30,798 INFO L290 TraceCheckUtils]: 59: Hoare triple {30910#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 106))} assume !(~x~0 % 4294967296 < 268435455); {30853#false} is VALID [2022-04-15 06:06:30,798 INFO L272 TraceCheckUtils]: 60: Hoare triple {30853#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {30853#false} is VALID [2022-04-15 06:06:30,798 INFO L290 TraceCheckUtils]: 61: Hoare triple {30853#false} ~cond := #in~cond; {30853#false} is VALID [2022-04-15 06:06:30,798 INFO L290 TraceCheckUtils]: 62: Hoare triple {30853#false} assume 0 == ~cond; {30853#false} is VALID [2022-04-15 06:06:30,798 INFO L290 TraceCheckUtils]: 63: Hoare triple {30853#false} assume !false; {30853#false} is VALID [2022-04-15 06:06:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:06:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864077879] [2022-04-15 06:06:30,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864077879] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436894663] [2022-04-15 06:06:30,799 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:06:30,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:30,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:30,800 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:06:30,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-04-15 06:06:30,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:06:30,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:30,942 WARN L261 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 109 conjunts are in the unsatisfiable core [2022-04-15 06:06:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:30,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:31,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {30852#true} call ULTIMATE.init(); {30852#true} is VALID [2022-04-15 06:06:31,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {30852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30852#true} is VALID [2022-04-15 06:06:31,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {30852#true} assume true; {30852#true} is VALID [2022-04-15 06:06:31,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30852#true} {30852#true} #34#return; {30852#true} is VALID [2022-04-15 06:06:31,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {30852#true} call #t~ret4 := main(); {30852#true} is VALID [2022-04-15 06:06:31,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {30852#true} ~x~0 := 0; {30857#(= main_~x~0 0)} is VALID [2022-04-15 06:06:31,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {30857#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30858#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:06:31,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {30858#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:06:31,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {30859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:06:31,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {30860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30861#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:06:31,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {30861#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30862#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:06:31,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {30862#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30863#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:06:31,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {30863#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:06:31,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {30864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30865#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:06:31,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {30865#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30866#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:06:31,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {30866#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:06:31,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {30867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30868#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:06:31,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {30868#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30869#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:06:31,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {30869#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30870#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:06:31,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {30870#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30871#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:06:31,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {30871#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30872#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:06:31,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {30872#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30873#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:06:31,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {30873#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30874#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:06:31,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {30874#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30875#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:06:31,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {30875#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30876#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:06:31,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {30876#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30877#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:06:31,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {30877#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30878#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:06:31,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {30878#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30879#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:06:31,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {30879#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30880#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:06:31,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {30880#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30881#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:06:31,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {30881#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30882#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:06:31,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {30882#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30883#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:06:31,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {30883#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30884#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:06:31,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {30884#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30885#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:06:31,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {30885#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30886#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:06:31,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {30886#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30887#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:06:31,611 INFO L290 TraceCheckUtils]: 36: Hoare triple {30887#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30888#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:06:31,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {30888#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30889#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:06:31,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {30889#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30890#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:06:31,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {30890#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30891#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:06:31,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {30891#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30892#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:06:31,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {30892#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30893#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:06:31,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {30893#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30894#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:06:31,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {30894#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30895#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:06:31,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {30895#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30896#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:06:31,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {30896#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30897#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:06:31,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {30897#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30898#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:06:31,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {30898#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30899#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:06:31,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {30899#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30900#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:06:31,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {30900#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30901#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:06:31,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {30901#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30902#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:06:31,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {30902#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30903#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:06:31,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {30903#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30904#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:06:31,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {30904#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30905#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:06:31,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {30905#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30906#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:06:31,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {30906#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30907#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:06:31,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {30907#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30908#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:06:31,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {30908#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30909#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:06:31,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {30909#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31089#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:06:31,622 INFO L290 TraceCheckUtils]: 59: Hoare triple {31089#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !(~x~0 % 4294967296 < 268435455); {30853#false} is VALID [2022-04-15 06:06:31,622 INFO L272 TraceCheckUtils]: 60: Hoare triple {30853#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {30853#false} is VALID [2022-04-15 06:06:31,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {30853#false} ~cond := #in~cond; {30853#false} is VALID [2022-04-15 06:06:31,622 INFO L290 TraceCheckUtils]: 62: Hoare triple {30853#false} assume 0 == ~cond; {30853#false} is VALID [2022-04-15 06:06:31,622 INFO L290 TraceCheckUtils]: 63: Hoare triple {30853#false} assume !false; {30853#false} is VALID [2022-04-15 06:06:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:06:31,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:36,213 INFO L290 TraceCheckUtils]: 63: Hoare triple {30853#false} assume !false; {30853#false} is VALID [2022-04-15 06:06:36,214 INFO L290 TraceCheckUtils]: 62: Hoare triple {30853#false} assume 0 == ~cond; {30853#false} is VALID [2022-04-15 06:06:36,214 INFO L290 TraceCheckUtils]: 61: Hoare triple {30853#false} ~cond := #in~cond; {30853#false} is VALID [2022-04-15 06:06:36,214 INFO L272 TraceCheckUtils]: 60: Hoare triple {30853#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {30853#false} is VALID [2022-04-15 06:06:36,214 INFO L290 TraceCheckUtils]: 59: Hoare triple {31117#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {30853#false} is VALID [2022-04-15 06:06:36,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {31121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31117#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {31125#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {31129#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31125#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {31133#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31129#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,217 INFO L290 TraceCheckUtils]: 54: Hoare triple {31137#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31133#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {31141#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31137#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {31145#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31141#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {31149#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31145#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {31153#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31149#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {31157#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31153#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,242 INFO L290 TraceCheckUtils]: 48: Hoare triple {31161#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31157#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {31165#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31161#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {31169#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31165#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {31173#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31169#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {31177#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31173#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {31181#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31177#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {31185#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31181#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {31189#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31185#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {31193#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31189#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {31197#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31193#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {31201#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31197#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {31205#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31201#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {31209#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31205#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {31213#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31209#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {31217#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31213#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {31221#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31217#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {31225#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31221#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {31229#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31225#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {31233#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31229#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {31237#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31233#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {31241#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31237#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {31245#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31241#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {31249#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31245#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {31253#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31249#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {31257#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31253#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {31261#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31257#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {31265#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31261#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {31269#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31265#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {31273#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31269#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {31277#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31273#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {31281#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31277#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {31285#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31281#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {31289#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31285#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {31293#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31289#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {31297#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31293#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {31301#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31297#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {31305#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31301#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {31309#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31305#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {31313#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31309#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {31317#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31313#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {31321#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31317#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {31325#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31321#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {31329#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31325#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {30852#true} ~x~0 := 0; {31329#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:06:36,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {30852#true} call #t~ret4 := main(); {30852#true} is VALID [2022-04-15 06:06:36,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30852#true} {30852#true} #34#return; {30852#true} is VALID [2022-04-15 06:06:36,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {30852#true} assume true; {30852#true} is VALID [2022-04-15 06:06:36,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {30852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30852#true} is VALID [2022-04-15 06:06:36,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {30852#true} call ULTIMATE.init(); {30852#true} is VALID [2022-04-15 06:06:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:06:36,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436894663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:36,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:36,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 112 [2022-04-15 06:06:36,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:36,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1344874130] [2022-04-15 06:06:36,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1344874130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:36,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:36,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 06:06:36,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917358203] [2022-04-15 06:06:36,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:36,280 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 06:06:36,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:36,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:36,329 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-15 06:06:36,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 06:06:36,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:36,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 06:06:36,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=9187, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 06:06:36,330 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:42,142 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-15 06:06:42,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 06:06:42,142 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-15 06:06:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-15 06:06:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-15 06:06:42,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 71 transitions. [2022-04-15 06:06:42,193 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-15 06:06:42,194 INFO L225 Difference]: With dead ends: 71 [2022-04-15 06:06:42,194 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 06:06:42,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=6483, Invalid=20907, Unknown=0, NotChecked=0, Total=27390 [2022-04-15 06:06:42,195 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2949 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:42,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2949 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 06:06:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 06:06:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-15 06:06:42,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:42,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:42,267 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:42,267 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:42,268 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 06:06:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-15 06:06:42,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:42,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:42,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-15 06:06:42,268 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-15 06:06:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:42,269 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 06:06:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-15 06:06:42,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:42,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:42,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:42,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:42,269 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-15 06:06:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2022-04-15 06:06:42,270 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2022-04-15 06:06:42,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:42,270 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2022-04-15 06:06:42,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:42,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 66 transitions. [2022-04-15 06:06:42,321 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-15 06:06:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-15 06:06:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 06:06:42,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:42,322 INFO L499 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:42,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Forceful destruction successful, exit code 0 [2022-04-15 06:06:42,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2022-04-15 06:06:42,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106,SelfDestructingSolverStorable107 [2022-04-15 06:06:42,727 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1874355100, now seen corresponding path program 107 times [2022-04-15 06:06:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:42,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2097840598] [2022-04-15 06:06:42,988 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:06:42,989 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:06:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1265275447, now seen corresponding path program 1 times [2022-04-15 06:06:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:42,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171569704] [2022-04-15 06:06:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:42,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:42,995 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_54.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_54.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:06:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:06:42,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585989781] [2022-04-15 06:06:42,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:42,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:42,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:42,999 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:06:43,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-04-15 06:06:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:43,043 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:06:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:43,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:06:43,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1874355100, now seen corresponding path program 108 times [2022-04-15 06:06:43,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:43,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015335962] [2022-04-15 06:06:43,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:43,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:44,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:44,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {31924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31864#true} is VALID [2022-04-15 06:06:44,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {31864#true} assume true; {31864#true} is VALID [2022-04-15 06:06:44,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31864#true} {31864#true} #34#return; {31864#true} is VALID [2022-04-15 06:06:44,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {31864#true} call ULTIMATE.init(); {31924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:44,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {31924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31864#true} is VALID [2022-04-15 06:06:44,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {31864#true} assume true; {31864#true} is VALID [2022-04-15 06:06:44,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31864#true} {31864#true} #34#return; {31864#true} is VALID [2022-04-15 06:06:44,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {31864#true} call #t~ret4 := main(); {31864#true} is VALID [2022-04-15 06:06:44,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {31864#true} ~x~0 := 0; {31869#(= main_~x~0 0)} is VALID [2022-04-15 06:06:44,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {31869#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:06:44,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {31870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31871#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:06:44,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {31871#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31872#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:06:44,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {31872#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31873#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:06:44,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {31873#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31874#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:06:44,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {31874#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31875#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:06:44,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {31875#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31876#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:06:44,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {31876#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31877#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:06:44,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {31877#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31878#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:06:44,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {31878#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31879#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:06:44,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {31879#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31880#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:06:44,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {31880#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31881#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:06:44,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {31881#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31882#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:06:44,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {31882#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31883#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:06:44,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {31883#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:06:44,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {31884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31885#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:06:44,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {31885#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31886#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:06:44,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {31886#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31887#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:06:44,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {31887#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31888#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:06:44,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {31888#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31889#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:06:44,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {31889#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31890#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:06:44,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {31890#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31891#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:06:44,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {31891#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31892#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:06:44,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {31892#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31893#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:06:44,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {31893#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31894#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:06:44,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {31894#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31895#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:06:44,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {31895#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31896#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:06:44,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {31896#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31897#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:06:44,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {31897#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31898#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:06:44,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {31898#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31899#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:06:44,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {31899#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31900#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:06:44,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {31900#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31901#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:06:44,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {31901#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31902#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:06:44,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {31902#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31903#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:06:44,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {31903#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31904#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:06:44,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {31904#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31905#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:06:44,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {31905#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31906#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:06:44,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {31906#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31907#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:06:44,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {31907#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31908#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:06:44,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {31908#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31909#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:06:44,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {31909#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31910#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:06:44,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {31910#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31911#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:06:44,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {31911#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31912#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:06:44,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {31912#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31913#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:06:44,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {31913#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31914#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:06:44,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {31914#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31915#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:06:44,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {31915#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31916#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:06:44,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {31916#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31917#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:06:44,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {31917#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31918#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:06:44,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {31918#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31919#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:06:44,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {31919#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31920#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:06:44,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {31920#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31921#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:06:44,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {31921#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31922#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:06:44,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {31922#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31923#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 108))} is VALID [2022-04-15 06:06:44,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {31923#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 108))} assume !(~x~0 % 4294967296 < 268435455); {31865#false} is VALID [2022-04-15 06:06:44,734 INFO L272 TraceCheckUtils]: 61: Hoare triple {31865#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {31865#false} is VALID [2022-04-15 06:06:44,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {31865#false} ~cond := #in~cond; {31865#false} is VALID [2022-04-15 06:06:44,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {31865#false} assume 0 == ~cond; {31865#false} is VALID [2022-04-15 06:06:44,734 INFO L290 TraceCheckUtils]: 64: Hoare triple {31865#false} assume !false; {31865#false} is VALID [2022-04-15 06:06:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:06:44,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:44,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015335962] [2022-04-15 06:06:44,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015335962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:44,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859504497] [2022-04-15 06:06:44,735 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:06:44,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:44,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:44,736 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:06:44,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-04-15 06:06:50,436 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-15 06:06:50,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:50,443 WARN L261 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 117 conjunts are in the unsatisfiable core [2022-04-15 06:06:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:50,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:51,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {31864#true} call ULTIMATE.init(); {31864#true} is VALID [2022-04-15 06:06:51,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {31864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31864#true} is VALID [2022-04-15 06:06:51,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {31864#true} assume true; {31864#true} is VALID [2022-04-15 06:06:51,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31864#true} {31864#true} #34#return; {31864#true} is VALID [2022-04-15 06:06:51,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {31864#true} call #t~ret4 := main(); {31864#true} is VALID [2022-04-15 06:06:51,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {31864#true} ~x~0 := 0; {31869#(= main_~x~0 0)} is VALID [2022-04-15 06:06:51,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {31869#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:06:51,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {31870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31871#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:06:51,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {31871#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31872#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:06:51,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {31872#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31873#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:06:51,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {31873#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31874#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:06:51,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {31874#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31875#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:06:51,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {31875#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31876#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:06:51,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {31876#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31877#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:06:51,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {31877#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31878#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:06:51,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {31878#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31879#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:06:51,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {31879#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31880#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:06:51,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {31880#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31881#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:06:51,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {31881#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31882#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:06:51,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {31882#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31883#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:06:51,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {31883#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:06:51,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {31884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31885#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:06:51,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {31885#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31886#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:06:51,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {31886#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31887#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:06:51,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {31887#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31888#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:06:51,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {31888#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31889#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:06:51,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {31889#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31890#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:06:51,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {31890#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31891#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:06:51,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {31891#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31892#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:06:51,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {31892#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31893#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:06:51,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {31893#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31894#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:06:51,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {31894#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31895#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:06:51,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {31895#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31896#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:06:51,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {31896#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31897#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:06:51,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {31897#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31898#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:06:51,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {31898#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31899#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:06:51,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {31899#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31900#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:06:51,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {31900#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31901#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:06:51,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {31901#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31902#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:06:51,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {31902#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31903#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:06:51,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {31903#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31904#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:06:51,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {31904#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31905#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:06:51,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {31905#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31906#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:06:51,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {31906#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31907#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:06:51,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {31907#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31908#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:06:51,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {31908#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31909#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:06:51,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {31909#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31910#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:06:51,044 INFO L290 TraceCheckUtils]: 47: Hoare triple {31910#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31911#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:06:51,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {31911#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31912#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:06:51,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {31912#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31913#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:06:51,046 INFO L290 TraceCheckUtils]: 50: Hoare triple {31913#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31914#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:06:51,046 INFO L290 TraceCheckUtils]: 51: Hoare triple {31914#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31915#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:06:51,046 INFO L290 TraceCheckUtils]: 52: Hoare triple {31915#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31916#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:06:51,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {31916#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31917#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:06:51,047 INFO L290 TraceCheckUtils]: 54: Hoare triple {31917#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31918#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:06:51,048 INFO L290 TraceCheckUtils]: 55: Hoare triple {31918#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31919#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:06:51,048 INFO L290 TraceCheckUtils]: 56: Hoare triple {31919#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31920#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:06:51,049 INFO L290 TraceCheckUtils]: 57: Hoare triple {31920#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31921#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:06:51,049 INFO L290 TraceCheckUtils]: 58: Hoare triple {31921#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31922#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:06:51,050 INFO L290 TraceCheckUtils]: 59: Hoare triple {31922#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32105#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:06:51,050 INFO L290 TraceCheckUtils]: 60: Hoare triple {32105#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !(~x~0 % 4294967296 < 268435455); {31865#false} is VALID [2022-04-15 06:06:51,050 INFO L272 TraceCheckUtils]: 61: Hoare triple {31865#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {31865#false} is VALID [2022-04-15 06:06:51,050 INFO L290 TraceCheckUtils]: 62: Hoare triple {31865#false} ~cond := #in~cond; {31865#false} is VALID [2022-04-15 06:06:51,051 INFO L290 TraceCheckUtils]: 63: Hoare triple {31865#false} assume 0 == ~cond; {31865#false} is VALID [2022-04-15 06:06:51,051 INFO L290 TraceCheckUtils]: 64: Hoare triple {31865#false} assume !false; {31865#false} is VALID [2022-04-15 06:06:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:06:51,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:57,346 INFO L290 TraceCheckUtils]: 64: Hoare triple {31865#false} assume !false; {31865#false} is VALID [2022-04-15 06:06:57,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {32124#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31865#false} is VALID [2022-04-15 06:06:57,347 INFO L290 TraceCheckUtils]: 62: Hoare triple {32128#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32124#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:06:57,347 INFO L272 TraceCheckUtils]: 61: Hoare triple {32132#(not (= (mod main_~x~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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {32128#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:06:57,348 INFO L290 TraceCheckUtils]: 60: Hoare triple {32136#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {32132#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:57,348 INFO L290 TraceCheckUtils]: 59: Hoare triple {32140#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32136#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {32144#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32140#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {32148#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32144#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,351 INFO L290 TraceCheckUtils]: 56: Hoare triple {32152#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32148#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,352 INFO L290 TraceCheckUtils]: 55: Hoare triple {32156#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32152#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,370 INFO L290 TraceCheckUtils]: 54: Hoare triple {32160#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32156#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {32164#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32160#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {32168#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32164#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {32172#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32168#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {32176#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32172#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {32180#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32176#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {32184#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32180#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {32188#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32184#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,378 INFO L290 TraceCheckUtils]: 46: Hoare triple {32192#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32188#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {32196#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32192#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {32200#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32196#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {32204#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32200#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {32208#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32204#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {32212#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32208#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {32216#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32212#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {32220#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32216#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {32224#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32220#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {32228#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32224#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {32232#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32228#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {32236#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32232#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {32240#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32236#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {32244#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32240#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {32248#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32244#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {32252#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32248#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {32256#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32252#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {32260#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32256#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {32264#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32260#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {32268#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32264#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {32272#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32268#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {32276#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32272#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {32280#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32276#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {32284#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32280#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {32288#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32284#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {32292#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32288#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {32296#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32292#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {32300#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32296#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {32304#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32300#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {32308#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32304#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {32312#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32308#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {32316#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32312#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {32320#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32316#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {32324#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32320#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {32328#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32324#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {32332#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32328#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {32336#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32332#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {32340#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32336#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {32344#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32340#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:06:57,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {32348#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32344#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {32352#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32348#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {31864#true} ~x~0 := 0; {32352#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:06:57,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {31864#true} call #t~ret4 := main(); {31864#true} is VALID [2022-04-15 06:06:57,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31864#true} {31864#true} #34#return; {31864#true} is VALID [2022-04-15 06:06:57,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {31864#true} assume true; {31864#true} is VALID [2022-04-15 06:06:57,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {31864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31864#true} is VALID [2022-04-15 06:06:57,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {31864#true} call ULTIMATE.init(); {31864#true} is VALID [2022-04-15 06:06:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:06:57,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859504497] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:57,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:57,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 60] total 117 [2022-04-15 06:06:57,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:57,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2097840598] [2022-04-15 06:06:57,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2097840598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:57,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:57,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 06:06:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354087390] [2022-04-15 06:06:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:57,435 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 06:06:57,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:57,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:06:57,469 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-15 06:06:57,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 06:06:57,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:57,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 06:06:57,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=10151, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 06:06:57,471 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:03,580 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 06:07:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 06:07:03,580 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 06:07:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-15 06:07:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-15 06:07:03,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 72 transitions. [2022-04-15 06:07:03,632 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-15 06:07:03,633 INFO L225 Difference]: With dead ends: 72 [2022-04-15 06:07:03,633 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 06:07:03,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=6774, Invalid=22638, Unknown=0, NotChecked=0, Total=29412 [2022-04-15 06:07:03,634 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 3197 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:03,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 238 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3197 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 06:07:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 06:07:03,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-15 06:07:03,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:03,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,705 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,705 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:03,706 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-15 06:07:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-15 06:07:03,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:03,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:03,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 06:07:03,707 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 06:07:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:03,707 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-15 06:07:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-15 06:07:03,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:03,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:03,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:03,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-15 06:07:03,709 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2022-04-15 06:07:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:03,709 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-15 06:07:03,709 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-15 06:07:03,772 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-15 06:07:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-15 06:07:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 06:07:03,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:03,773 INFO L499 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:03,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2022-04-15 06:07:03,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2022-04-15 06:07:04,173 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:04,174 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:04,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1988072778, now seen corresponding path program 109 times [2022-04-15 06:07:04,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:04,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [821179792] [2022-04-15 06:07:04,325 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:04,327 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:07:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1324380791, now seen corresponding path program 1 times [2022-04-15 06:07:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:04,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995433502] [2022-04-15 06:07:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:04,332 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_55.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_55.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 06:07:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:07:04,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970521478] [2022-04-15 06:07:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:04,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:04,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:04,338 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:07:04,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-04-15 06:07:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:04,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:07:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:04,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:07:04,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1988072778, now seen corresponding path program 110 times [2022-04-15 06:07:04,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:04,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389906403] [2022-04-15 06:07:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:05,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:05,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {32956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32895#true} is VALID [2022-04-15 06:07:05,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {32895#true} assume true; {32895#true} is VALID [2022-04-15 06:07:05,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32895#true} {32895#true} #34#return; {32895#true} is VALID [2022-04-15 06:07:05,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {32895#true} call ULTIMATE.init(); {32956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:05,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {32956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32895#true} is VALID [2022-04-15 06:07:05,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {32895#true} assume true; {32895#true} is VALID [2022-04-15 06:07:05,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32895#true} {32895#true} #34#return; {32895#true} is VALID [2022-04-15 06:07:05,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {32895#true} call #t~ret4 := main(); {32895#true} is VALID [2022-04-15 06:07:05,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {32895#true} ~x~0 := 0; {32900#(= main_~x~0 0)} is VALID [2022-04-15 06:07:05,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {32900#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32901#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:05,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {32901#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32902#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:07:05,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {32902#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32903#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:07:05,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {32903#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32904#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:07:05,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {32904#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32905#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:07:05,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {32905#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32906#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:07:05,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {32906#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:07:05,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {32907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32908#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:07:05,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {32908#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32909#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:07:05,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {32909#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32910#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:07:05,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {32910#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32911#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:07:05,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {32911#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32912#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:07:05,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {32912#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32913#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:07:05,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {32913#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32914#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:07:05,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {32914#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32915#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:07:05,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {32915#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32916#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:07:05,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {32916#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32917#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:07:05,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {32917#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32918#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:07:05,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {32918#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32919#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:07:05,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {32919#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32920#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:07:05,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {32920#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32921#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:07:05,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {32921#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32922#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:07:05,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {32922#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32923#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:07:05,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {32923#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32924#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:07:05,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {32924#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32925#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:07:05,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {32925#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32926#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:07:05,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {32926#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32927#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:07:05,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {32927#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32928#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:07:05,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {32928#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32929#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:07:05,983 INFO L290 TraceCheckUtils]: 35: Hoare triple {32929#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32930#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:07:05,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {32930#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32931#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:07:05,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {32931#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32932#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:07:05,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {32932#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32933#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:07:05,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {32933#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32934#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:07:05,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {32934#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32935#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:07:05,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {32935#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32936#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:07:05,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {32936#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32937#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:07:05,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {32937#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32938#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:07:05,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {32938#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32939#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:07:05,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {32939#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32940#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:07:05,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {32940#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32941#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:07:05,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {32941#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32942#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:07:05,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {32942#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32943#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:07:05,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {32943#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32944#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:07:05,991 INFO L290 TraceCheckUtils]: 50: Hoare triple {32944#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32945#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:07:05,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {32945#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32946#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:07:05,992 INFO L290 TraceCheckUtils]: 52: Hoare triple {32946#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32947#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:07:05,992 INFO L290 TraceCheckUtils]: 53: Hoare triple {32947#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32948#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:07:05,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {32948#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32949#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:07:05,993 INFO L290 TraceCheckUtils]: 55: Hoare triple {32949#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32950#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:07:05,993 INFO L290 TraceCheckUtils]: 56: Hoare triple {32950#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32951#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:07:05,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {32951#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32952#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:07:05,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {32952#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32953#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:07:05,995 INFO L290 TraceCheckUtils]: 59: Hoare triple {32953#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32954#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:07:05,995 INFO L290 TraceCheckUtils]: 60: Hoare triple {32954#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32955#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 110))} is VALID [2022-04-15 06:07:05,996 INFO L290 TraceCheckUtils]: 61: Hoare triple {32955#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 110))} assume !(~x~0 % 4294967296 < 268435455); {32896#false} is VALID [2022-04-15 06:07:05,996 INFO L272 TraceCheckUtils]: 62: Hoare triple {32896#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {32896#false} is VALID [2022-04-15 06:07:05,996 INFO L290 TraceCheckUtils]: 63: Hoare triple {32896#false} ~cond := #in~cond; {32896#false} is VALID [2022-04-15 06:07:05,996 INFO L290 TraceCheckUtils]: 64: Hoare triple {32896#false} assume 0 == ~cond; {32896#false} is VALID [2022-04-15 06:07:05,996 INFO L290 TraceCheckUtils]: 65: Hoare triple {32896#false} assume !false; {32896#false} is VALID [2022-04-15 06:07:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:05,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:05,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389906403] [2022-04-15 06:07:05,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389906403] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:05,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217384575] [2022-04-15 06:07:05,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:07:05,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:05,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:05,998 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:07:05,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-04-15 06:07:06,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:07:06,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:06,068 WARN L261 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 113 conjunts are in the unsatisfiable core [2022-04-15 06:07:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:06,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:06,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {32895#true} call ULTIMATE.init(); {32895#true} is VALID [2022-04-15 06:07:06,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {32895#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32895#true} is VALID [2022-04-15 06:07:06,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {32895#true} assume true; {32895#true} is VALID [2022-04-15 06:07:06,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32895#true} {32895#true} #34#return; {32895#true} is VALID [2022-04-15 06:07:06,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {32895#true} call #t~ret4 := main(); {32895#true} is VALID [2022-04-15 06:07:06,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {32895#true} ~x~0 := 0; {32900#(= main_~x~0 0)} is VALID [2022-04-15 06:07:06,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {32900#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32901#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:06,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {32901#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32902#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:07:06,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {32902#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32903#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:07:06,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {32903#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32904#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:07:06,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {32904#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32905#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:07:06,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {32905#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32906#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:07:06,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {32906#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:07:06,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {32907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32908#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:07:06,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {32908#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32909#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:07:06,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {32909#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32910#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:07:06,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {32910#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32911#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:07:06,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {32911#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32912#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:07:06,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {32912#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32913#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:07:06,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {32913#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32914#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:07:06,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {32914#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32915#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:07:06,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {32915#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32916#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:07:06,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {32916#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32917#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:07:06,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {32917#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32918#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:07:06,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {32918#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32919#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:07:06,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {32919#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32920#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:07:06,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {32920#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32921#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:07:06,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {32921#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32922#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:07:06,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {32922#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32923#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:07:06,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {32923#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32924#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:07:06,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {32924#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32925#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:07:06,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {32925#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32926#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:07:06,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {32926#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32927#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:07:06,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {32927#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32928#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:07:06,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {32928#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32929#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:07:06,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {32929#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32930#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:07:06,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {32930#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32931#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:07:06,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {32931#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32932#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:07:06,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {32932#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32933#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:07:06,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {32933#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32934#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:07:06,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {32934#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32935#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:07:06,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {32935#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32936#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:07:06,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {32936#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32937#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:07:06,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {32937#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32938#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:07:06,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {32938#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32939#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:07:06,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {32939#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32940#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:07:06,821 INFO L290 TraceCheckUtils]: 46: Hoare triple {32940#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32941#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:07:06,821 INFO L290 TraceCheckUtils]: 47: Hoare triple {32941#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32942#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:07:06,822 INFO L290 TraceCheckUtils]: 48: Hoare triple {32942#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32943#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:07:06,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {32943#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32944#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:07:06,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {32944#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32945#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:07:06,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {32945#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32946#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:07:06,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {32946#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32947#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:07:06,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {32947#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32948#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:07:06,825 INFO L290 TraceCheckUtils]: 54: Hoare triple {32948#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32949#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:07:06,825 INFO L290 TraceCheckUtils]: 55: Hoare triple {32949#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32950#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:07:06,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {32950#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32951#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:07:06,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {32951#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32952#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:07:06,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {32952#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32953#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:07:06,827 INFO L290 TraceCheckUtils]: 59: Hoare triple {32953#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32954#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:07:06,828 INFO L290 TraceCheckUtils]: 60: Hoare triple {32954#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33140#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:07:06,828 INFO L290 TraceCheckUtils]: 61: Hoare triple {33140#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !(~x~0 % 4294967296 < 268435455); {32896#false} is VALID [2022-04-15 06:07:06,828 INFO L272 TraceCheckUtils]: 62: Hoare triple {32896#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {32896#false} is VALID [2022-04-15 06:07:06,828 INFO L290 TraceCheckUtils]: 63: Hoare triple {32896#false} ~cond := #in~cond; {32896#false} is VALID [2022-04-15 06:07:06,828 INFO L290 TraceCheckUtils]: 64: Hoare triple {32896#false} assume 0 == ~cond; {32896#false} is VALID [2022-04-15 06:07:06,828 INFO L290 TraceCheckUtils]: 65: Hoare triple {32896#false} assume !false; {32896#false} is VALID [2022-04-15 06:07:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:06,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:11,639 INFO L290 TraceCheckUtils]: 65: Hoare triple {32896#false} assume !false; {32896#false} is VALID [2022-04-15 06:07:11,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {32896#false} assume 0 == ~cond; {32896#false} is VALID [2022-04-15 06:07:11,640 INFO L290 TraceCheckUtils]: 63: Hoare triple {32896#false} ~cond := #in~cond; {32896#false} is VALID [2022-04-15 06:07:11,640 INFO L272 TraceCheckUtils]: 62: Hoare triple {32896#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {32896#false} is VALID [2022-04-15 06:07:11,640 INFO L290 TraceCheckUtils]: 61: Hoare triple {33168#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {32896#false} is VALID [2022-04-15 06:07:11,645 INFO L290 TraceCheckUtils]: 60: Hoare triple {33172#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33168#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,646 INFO L290 TraceCheckUtils]: 59: Hoare triple {33176#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33172#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {33180#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33176#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,705 INFO L290 TraceCheckUtils]: 57: Hoare triple {33184#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33180#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,706 INFO L290 TraceCheckUtils]: 56: Hoare triple {33188#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33184#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,707 INFO L290 TraceCheckUtils]: 55: Hoare triple {33192#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33188#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,707 INFO L290 TraceCheckUtils]: 54: Hoare triple {33196#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33192#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {33200#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33196#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {33204#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33200#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {33208#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33204#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,710 INFO L290 TraceCheckUtils]: 50: Hoare triple {33212#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33208#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,710 INFO L290 TraceCheckUtils]: 49: Hoare triple {33216#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33212#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,711 INFO L290 TraceCheckUtils]: 48: Hoare triple {33220#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33216#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,712 INFO L290 TraceCheckUtils]: 47: Hoare triple {33224#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33220#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {33228#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33224#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {33232#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33228#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {33236#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33232#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {33240#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33236#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {33244#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33240#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {33248#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33244#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {33252#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33248#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {33256#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33252#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {33260#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33256#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {33264#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33260#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {33268#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33264#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {33272#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33268#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {33276#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33272#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {33280#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33276#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {33284#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33280#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {33288#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33284#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {33292#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33288#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {33296#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33292#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {33300#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33296#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {33304#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33300#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {33308#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33304#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {33312#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33308#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {33316#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33312#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {33320#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33316#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {33324#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33320#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {33328#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33324#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {33332#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33328#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {33336#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33332#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {33340#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33336#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {33344#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33340#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {33348#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33344#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {33352#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33348#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {33356#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33352#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {33360#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33356#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {33364#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33360#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {33368#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33364#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {33372#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33368#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {33376#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33372#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {33380#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33376#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {33384#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33380#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {33388#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33384#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {32895#true} ~x~0 := 0; {33388#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:11,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {32895#true} call #t~ret4 := main(); {32895#true} is VALID [2022-04-15 06:07:11,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32895#true} {32895#true} #34#return; {32895#true} is VALID [2022-04-15 06:07:11,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {32895#true} assume true; {32895#true} is VALID [2022-04-15 06:07:11,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {32895#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32895#true} is VALID [2022-04-15 06:07:11,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {32895#true} call ULTIMATE.init(); {32895#true} is VALID [2022-04-15 06:07:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:11,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217384575] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:11,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:11,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 116 [2022-04-15 06:07:11,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:11,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [821179792] [2022-04-15 06:07:11,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [821179792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:11,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:11,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 06:07:11,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599808956] [2022-04-15 06:07:11,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:11,740 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 06:07:11,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:11,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:11,779 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-15 06:07:11,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 06:07:11,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:11,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 06:07:11,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3477, Invalid=9863, Unknown=0, NotChecked=0, Total=13340 [2022-04-15 06:07:11,782 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:18,216 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-15 06:07:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 06:07:18,216 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 06:07:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-15 06:07:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-15 06:07:18,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 73 transitions. [2022-04-15 06:07:18,267 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-15 06:07:18,268 INFO L225 Difference]: With dead ends: 73 [2022-04-15 06:07:18,268 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 06:07:18,269 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=6947, Invalid=22465, Unknown=0, NotChecked=0, Total=29412 [2022-04-15 06:07:18,269 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 3322 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:18,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 253 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3322 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 06:07:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 06:07:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-15 06:07:18,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:18,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:18,345 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:18,346 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:18,346 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 06:07:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-15 06:07:18,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:18,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:18,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 06:07:18,347 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 06:07:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:18,347 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 06:07:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-15 06:07:18,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:18,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:18,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:18,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:18,347 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-15 06:07:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2022-04-15 06:07:18,348 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2022-04-15 06:07:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:18,348 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2022-04-15 06:07:18,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:18,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 68 transitions. [2022-04-15 06:07:18,401 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-15 06:07:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-15 06:07:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 06:07:18,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:18,402 INFO L499 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:18,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Forceful destruction successful, exit code 0 [2022-04-15 06:07:18,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Forceful destruction successful, exit code 0 [2022-04-15 06:07:18,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable110,111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-04-15 06:07:18,804 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252708, now seen corresponding path program 111 times [2022-04-15 06:07:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:18,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1096367296] [2022-04-15 06:07:19,117 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:19,118 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:07:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1383486135, now seen corresponding path program 1 times [2022-04-15 06:07:19,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:19,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055975488] [2022-04-15 06:07:19,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:19,124 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_56.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_56.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:07:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:07:19,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285398877] [2022-04-15 06:07:19,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:19,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:19,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:19,132 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:07:19,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-04-15 06:07:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:19,180 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:07:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:19,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:07:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252708, now seen corresponding path program 112 times [2022-04-15 06:07:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:19,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723715438] [2022-04-15 06:07:19,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:19,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:20,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:20,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {34001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33939#true} is VALID [2022-04-15 06:07:20,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {33939#true} assume true; {33939#true} is VALID [2022-04-15 06:07:20,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33939#true} {33939#true} #34#return; {33939#true} is VALID [2022-04-15 06:07:20,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {33939#true} call ULTIMATE.init(); {34001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:20,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {34001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33939#true} is VALID [2022-04-15 06:07:20,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {33939#true} assume true; {33939#true} is VALID [2022-04-15 06:07:20,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33939#true} {33939#true} #34#return; {33939#true} is VALID [2022-04-15 06:07:20,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {33939#true} call #t~ret4 := main(); {33939#true} is VALID [2022-04-15 06:07:20,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {33939#true} ~x~0 := 0; {33944#(= main_~x~0 0)} is VALID [2022-04-15 06:07:20,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {33944#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:20,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {33945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33946#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:07:20,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {33946#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33947#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:07:20,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {33947#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33948#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:07:20,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {33948#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:07:20,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {33949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:07:20,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {33950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33951#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:07:20,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {33951#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33952#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:07:20,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {33952#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33953#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:07:20,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {33953#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33954#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:07:20,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {33954#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33955#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:07:20,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {33955#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33956#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:07:20,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {33956#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33957#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:07:20,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {33957#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33958#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:07:20,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {33958#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33959#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:07:20,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {33959#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33960#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:07:20,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {33960#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33961#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:07:20,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {33961#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33962#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:07:20,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {33962#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33963#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:07:20,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {33963#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33964#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:07:20,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {33964#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33965#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:07:20,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {33965#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33966#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:07:20,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {33966#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33967#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:07:20,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {33967#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33968#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:07:20,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {33968#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33969#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:07:20,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {33969#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33970#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:07:20,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {33970#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33971#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:07:20,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {33971#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33972#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:07:20,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {33972#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33973#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:07:20,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {33973#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33974#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:07:20,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {33974#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33975#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:07:20,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {33975#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33976#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:07:20,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {33976#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33977#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:07:20,855 INFO L290 TraceCheckUtils]: 39: Hoare triple {33977#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33978#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:07:20,855 INFO L290 TraceCheckUtils]: 40: Hoare triple {33978#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33979#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:07:20,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {33979#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33980#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:07:20,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {33980#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33981#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:07:20,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {33981#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33982#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:07:20,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {33982#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33983#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:07:20,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {33983#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33984#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:07:20,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {33984#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33985#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:07:20,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {33985#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33986#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:07:20,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {33986#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33987#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:07:20,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {33987#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33988#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:07:20,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {33988#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33989#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:07:20,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {33989#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33990#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:07:20,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {33990#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33991#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:07:20,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {33991#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33992#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:07:20,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {33992#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33993#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:07:20,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {33993#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33994#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:07:20,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {33994#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33995#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:07:20,864 INFO L290 TraceCheckUtils]: 57: Hoare triple {33995#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33996#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:07:20,864 INFO L290 TraceCheckUtils]: 58: Hoare triple {33996#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33997#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:07:20,865 INFO L290 TraceCheckUtils]: 59: Hoare triple {33997#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33998#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:07:20,865 INFO L290 TraceCheckUtils]: 60: Hoare triple {33998#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33999#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:07:20,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {33999#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34000#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 112))} is VALID [2022-04-15 06:07:20,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {34000#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 112))} assume !(~x~0 % 4294967296 < 268435455); {33940#false} is VALID [2022-04-15 06:07:20,866 INFO L272 TraceCheckUtils]: 63: Hoare triple {33940#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {33940#false} is VALID [2022-04-15 06:07:20,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {33940#false} ~cond := #in~cond; {33940#false} is VALID [2022-04-15 06:07:20,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {33940#false} assume 0 == ~cond; {33940#false} is VALID [2022-04-15 06:07:20,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {33940#false} assume !false; {33940#false} is VALID [2022-04-15 06:07:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:20,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723715438] [2022-04-15 06:07:20,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723715438] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:20,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259840760] [2022-04-15 06:07:20,867 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:07:20,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:20,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:20,868 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:07:20,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-04-15 06:07:20,992 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:07:20,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:20,994 WARN L261 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 115 conjunts are in the unsatisfiable core [2022-04-15 06:07:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:21,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:21,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {33939#true} call ULTIMATE.init(); {33939#true} is VALID [2022-04-15 06:07:21,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {33939#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33939#true} is VALID [2022-04-15 06:07:21,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {33939#true} assume true; {33939#true} is VALID [2022-04-15 06:07:21,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33939#true} {33939#true} #34#return; {33939#true} is VALID [2022-04-15 06:07:21,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {33939#true} call #t~ret4 := main(); {33939#true} is VALID [2022-04-15 06:07:21,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {33939#true} ~x~0 := 0; {33944#(= main_~x~0 0)} is VALID [2022-04-15 06:07:21,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {33944#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:21,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {33945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33946#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:07:21,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {33946#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33947#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:07:21,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {33947#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33948#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:07:21,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {33948#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:07:21,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {33949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:07:21,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {33950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33951#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:07:21,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {33951#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33952#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:07:21,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {33952#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33953#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:07:21,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {33953#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33954#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:07:21,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {33954#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33955#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:07:21,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {33955#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33956#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:07:21,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {33956#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33957#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:07:21,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {33957#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33958#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:07:21,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {33958#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33959#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:07:21,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {33959#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33960#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:07:21,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {33960#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33961#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:07:21,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {33961#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33962#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:07:21,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {33962#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33963#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:07:21,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {33963#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33964#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:07:21,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {33964#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33965#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:07:21,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {33965#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33966#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:07:21,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {33966#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33967#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:07:21,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {33967#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33968#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:07:21,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {33968#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33969#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:07:21,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {33969#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33970#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:07:21,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {33970#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33971#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:07:21,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {33971#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33972#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:07:21,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {33972#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33973#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:07:21,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {33973#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33974#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:07:21,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {33974#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33975#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:07:21,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {33975#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33976#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:07:21,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {33976#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33977#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:07:21,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {33977#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33978#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:07:21,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {33978#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33979#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:07:21,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {33979#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33980#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:07:21,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {33980#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33981#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:07:21,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {33981#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33982#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:07:21,700 INFO L290 TraceCheckUtils]: 44: Hoare triple {33982#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33983#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:07:21,701 INFO L290 TraceCheckUtils]: 45: Hoare triple {33983#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33984#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:07:21,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {33984#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33985#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:07:21,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {33985#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33986#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:07:21,702 INFO L290 TraceCheckUtils]: 48: Hoare triple {33986#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33987#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:07:21,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {33987#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33988#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:07:21,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {33988#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33989#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:07:21,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {33989#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33990#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:07:21,704 INFO L290 TraceCheckUtils]: 52: Hoare triple {33990#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33991#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:07:21,704 INFO L290 TraceCheckUtils]: 53: Hoare triple {33991#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33992#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:07:21,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {33992#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33993#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:07:21,705 INFO L290 TraceCheckUtils]: 55: Hoare triple {33993#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33994#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:07:21,706 INFO L290 TraceCheckUtils]: 56: Hoare triple {33994#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33995#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:07:21,706 INFO L290 TraceCheckUtils]: 57: Hoare triple {33995#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33996#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:07:21,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {33996#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33997#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:07:21,707 INFO L290 TraceCheckUtils]: 59: Hoare triple {33997#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33998#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:07:21,708 INFO L290 TraceCheckUtils]: 60: Hoare triple {33998#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33999#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:07:21,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {33999#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34188#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:07:21,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {34188#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {33940#false} is VALID [2022-04-15 06:07:21,709 INFO L272 TraceCheckUtils]: 63: Hoare triple {33940#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {33940#false} is VALID [2022-04-15 06:07:21,709 INFO L290 TraceCheckUtils]: 64: Hoare triple {33940#false} ~cond := #in~cond; {33940#false} is VALID [2022-04-15 06:07:21,709 INFO L290 TraceCheckUtils]: 65: Hoare triple {33940#false} assume 0 == ~cond; {33940#false} is VALID [2022-04-15 06:07:21,709 INFO L290 TraceCheckUtils]: 66: Hoare triple {33940#false} assume !false; {33940#false} is VALID [2022-04-15 06:07:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:21,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:26,828 INFO L290 TraceCheckUtils]: 66: Hoare triple {33940#false} assume !false; {33940#false} is VALID [2022-04-15 06:07:26,828 INFO L290 TraceCheckUtils]: 65: Hoare triple {33940#false} assume 0 == ~cond; {33940#false} is VALID [2022-04-15 06:07:26,828 INFO L290 TraceCheckUtils]: 64: Hoare triple {33940#false} ~cond := #in~cond; {33940#false} is VALID [2022-04-15 06:07:26,828 INFO L272 TraceCheckUtils]: 63: Hoare triple {33940#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {33940#false} is VALID [2022-04-15 06:07:26,828 INFO L290 TraceCheckUtils]: 62: Hoare triple {34216#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {33940#false} is VALID [2022-04-15 06:07:26,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {34220#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34216#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,830 INFO L290 TraceCheckUtils]: 60: Hoare triple {34224#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34220#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,830 INFO L290 TraceCheckUtils]: 59: Hoare triple {34228#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34224#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,831 INFO L290 TraceCheckUtils]: 58: Hoare triple {34232#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34228#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,831 INFO L290 TraceCheckUtils]: 57: Hoare triple {34236#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34232#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {34240#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34236#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {34244#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34240#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {34248#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34244#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {34252#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34248#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {34256#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34252#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {34260#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34256#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {34264#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34260#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,836 INFO L290 TraceCheckUtils]: 49: Hoare triple {34268#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34264#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {34272#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34268#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {34276#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34272#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,838 INFO L290 TraceCheckUtils]: 46: Hoare triple {34280#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34276#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {34284#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34280#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {34288#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34284#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {34292#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34288#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {34296#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34292#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,841 INFO L290 TraceCheckUtils]: 41: Hoare triple {34300#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34296#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,842 INFO L290 TraceCheckUtils]: 40: Hoare triple {34304#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34300#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {34308#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34304#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {34312#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34308#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {34316#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34312#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {34320#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34316#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {34324#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34320#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {34328#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34324#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {34332#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34328#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {34336#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34332#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {34340#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34336#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {34344#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34340#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {34348#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34344#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {34352#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34348#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {34356#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34352#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {34360#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34356#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {34364#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34360#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {34368#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34364#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {34372#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34368#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {34376#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34372#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {34380#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34376#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {34384#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34380#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {34388#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34384#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {34392#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34388#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {34396#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34392#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {34400#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34396#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {34404#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34400#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {34408#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34404#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {34412#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34408#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {34416#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34412#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {34420#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34416#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {34424#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34420#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {34428#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34424#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {34432#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34428#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {34436#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34432#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {34440#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34436#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {33939#true} ~x~0 := 0; {34440#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:26,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {33939#true} call #t~ret4 := main(); {33939#true} is VALID [2022-04-15 06:07:26,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33939#true} {33939#true} #34#return; {33939#true} is VALID [2022-04-15 06:07:26,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {33939#true} assume true; {33939#true} is VALID [2022-04-15 06:07:26,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {33939#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33939#true} is VALID [2022-04-15 06:07:26,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {33939#true} call ULTIMATE.init(); {33939#true} is VALID [2022-04-15 06:07:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:26,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259840760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:26,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:26,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 118 [2022-04-15 06:07:26,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:26,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1096367296] [2022-04-15 06:07:26,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1096367296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:26,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:26,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 06:07:26,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690259929] [2022-04-15 06:07:26,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:26,865 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 06:07:26,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:26,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:26,902 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-15 06:07:26,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 06:07:26,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:26,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 06:07:26,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=10210, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 06:07:26,903 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:33,254 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-15 06:07:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 06:07:33,254 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 06:07:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-15 06:07:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-15 06:07:33,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-15 06:07:33,302 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-15 06:07:33,303 INFO L225 Difference]: With dead ends: 74 [2022-04-15 06:07:33,303 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 06:07:33,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=7185, Invalid=23265, Unknown=0, NotChecked=0, Total=30450 [2022-04-15 06:07:33,304 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:33,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 06:07:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 06:07:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-15 06:07:33,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:33,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:33,378 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:33,379 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:33,379 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-15 06:07:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-15 06:07:33,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:33,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:33,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 06:07:33,380 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 06:07:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:33,380 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-15 06:07:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-15 06:07:33,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:33,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:33,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:33,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-04-15 06:07:33,382 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2022-04-15 06:07:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:33,382 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-04-15 06:07:33,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:33,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 69 transitions. [2022-04-15 06:07:33,456 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-15 06:07:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-15 06:07:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 06:07:33,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:33,457 INFO L499 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:33,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2022-04-15 06:07:33,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2022-04-15 06:07:33,857 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113 [2022-04-15 06:07:33,857 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:33,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:33,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1889267574, now seen corresponding path program 113 times [2022-04-15 06:07:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:33,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [369261656] [2022-04-15 06:07:34,071 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:34,072 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:07:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1442591479, now seen corresponding path program 1 times [2022-04-15 06:07:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:34,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536480785] [2022-04-15 06:07:34,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:34,078 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_57.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_57.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:07:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:07:34,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659552181] [2022-04-15 06:07:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:34,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:34,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:34,082 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:07:34,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-04-15 06:07:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:34,127 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:07:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:34,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:07:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1889267574, now seen corresponding path program 114 times [2022-04-15 06:07:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:34,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664565307] [2022-04-15 06:07:34,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:34,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:35,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:35,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {35062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34999#true} is VALID [2022-04-15 06:07:35,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {34999#true} assume true; {34999#true} is VALID [2022-04-15 06:07:35,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34999#true} {34999#true} #34#return; {34999#true} is VALID [2022-04-15 06:07:35,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {34999#true} call ULTIMATE.init(); {35062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:35,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {35062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34999#true} is VALID [2022-04-15 06:07:35,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {34999#true} assume true; {34999#true} is VALID [2022-04-15 06:07:35,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34999#true} {34999#true} #34#return; {34999#true} is VALID [2022-04-15 06:07:35,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {34999#true} call #t~ret4 := main(); {34999#true} is VALID [2022-04-15 06:07:35,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {34999#true} ~x~0 := 0; {35004#(= main_~x~0 0)} is VALID [2022-04-15 06:07:35,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {35004#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:35,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {35005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35006#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:07:35,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {35006#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35007#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:07:35,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {35007#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:07:35,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {35008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35009#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:07:35,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {35009#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35010#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:07:35,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {35010#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35011#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:07:35,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {35011#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35012#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:07:35,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {35012#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35013#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:07:35,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {35013#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35014#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:07:35,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {35014#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35015#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:07:35,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {35015#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35016#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:07:35,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {35016#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35017#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:07:35,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {35017#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35018#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:07:35,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {35018#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35019#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:07:35,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {35019#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35020#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:07:35,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {35020#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35021#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:07:35,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {35021#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35022#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:07:35,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {35022#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35023#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:07:35,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {35023#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35024#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:07:35,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {35024#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35025#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:07:35,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {35025#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35026#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:07:35,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {35026#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35027#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:07:35,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {35027#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35028#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:07:35,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {35028#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35029#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:07:35,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {35029#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35030#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:07:35,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {35030#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35031#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:07:35,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {35031#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35032#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:07:35,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {35032#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35033#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:07:35,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {35033#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35034#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:07:35,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {35034#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35035#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:07:35,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {35035#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35036#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:07:35,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {35036#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35037#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:07:35,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {35037#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35038#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:07:35,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {35038#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35039#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:07:35,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {35039#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35040#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:07:35,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {35040#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35041#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:07:35,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {35041#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35042#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:07:35,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {35042#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35043#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:07:35,881 INFO L290 TraceCheckUtils]: 45: Hoare triple {35043#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35044#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:07:35,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {35044#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35045#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:07:35,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {35045#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35046#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:07:35,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {35046#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35047#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:07:35,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {35047#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35048#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:07:35,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {35048#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35049#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:07:35,884 INFO L290 TraceCheckUtils]: 51: Hoare triple {35049#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35050#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:07:35,884 INFO L290 TraceCheckUtils]: 52: Hoare triple {35050#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35051#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:07:35,885 INFO L290 TraceCheckUtils]: 53: Hoare triple {35051#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35052#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:07:35,885 INFO L290 TraceCheckUtils]: 54: Hoare triple {35052#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35053#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:07:35,886 INFO L290 TraceCheckUtils]: 55: Hoare triple {35053#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35054#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:07:35,886 INFO L290 TraceCheckUtils]: 56: Hoare triple {35054#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35055#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:07:35,887 INFO L290 TraceCheckUtils]: 57: Hoare triple {35055#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35056#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:07:35,887 INFO L290 TraceCheckUtils]: 58: Hoare triple {35056#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35057#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:07:35,888 INFO L290 TraceCheckUtils]: 59: Hoare triple {35057#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35058#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:07:35,888 INFO L290 TraceCheckUtils]: 60: Hoare triple {35058#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35059#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:07:35,889 INFO L290 TraceCheckUtils]: 61: Hoare triple {35059#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35060#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:07:35,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {35060#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35061#(and (<= main_~x~0 114) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:07:35,890 INFO L290 TraceCheckUtils]: 63: Hoare triple {35061#(and (<= main_~x~0 114) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {35000#false} is VALID [2022-04-15 06:07:35,890 INFO L272 TraceCheckUtils]: 64: Hoare triple {35000#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {35000#false} is VALID [2022-04-15 06:07:35,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {35000#false} ~cond := #in~cond; {35000#false} is VALID [2022-04-15 06:07:35,890 INFO L290 TraceCheckUtils]: 66: Hoare triple {35000#false} assume 0 == ~cond; {35000#false} is VALID [2022-04-15 06:07:35,890 INFO L290 TraceCheckUtils]: 67: Hoare triple {35000#false} assume !false; {35000#false} is VALID [2022-04-15 06:07:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:35,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:35,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664565307] [2022-04-15 06:07:35,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664565307] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:35,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899303662] [2022-04-15 06:07:35,891 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:07:35,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:35,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:35,892 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:07:35,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-04-15 06:07:41,967 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2022-04-15 06:07:41,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:41,976 WARN L261 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 117 conjunts are in the unsatisfiable core [2022-04-15 06:07:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:42,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:42,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {34999#true} call ULTIMATE.init(); {34999#true} is VALID [2022-04-15 06:07:42,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {34999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34999#true} is VALID [2022-04-15 06:07:42,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {34999#true} assume true; {34999#true} is VALID [2022-04-15 06:07:42,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34999#true} {34999#true} #34#return; {34999#true} is VALID [2022-04-15 06:07:42,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {34999#true} call #t~ret4 := main(); {34999#true} is VALID [2022-04-15 06:07:42,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {34999#true} ~x~0 := 0; {35004#(= main_~x~0 0)} is VALID [2022-04-15 06:07:42,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {35004#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:42,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {35005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35006#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:07:42,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {35006#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35007#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:07:42,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {35007#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:07:42,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {35008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35009#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:07:42,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {35009#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35010#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:07:42,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {35010#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35011#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:07:42,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {35011#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35012#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:07:42,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {35012#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35013#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:07:42,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {35013#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35014#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:07:42,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {35014#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35015#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:07:42,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {35015#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35016#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:07:42,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {35016#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35017#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:07:42,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {35017#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35018#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:07:42,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {35018#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35019#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:07:42,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {35019#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35020#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:07:42,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {35020#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35021#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:07:42,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {35021#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35022#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:07:42,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {35022#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35023#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:07:42,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {35023#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35024#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:07:42,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {35024#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35025#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:07:42,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {35025#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35026#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:07:42,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {35026#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35027#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:07:42,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {35027#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35028#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:07:42,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {35028#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35029#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:07:42,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {35029#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35030#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:07:42,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {35030#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35031#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:07:42,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {35031#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35032#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:07:42,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {35032#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35033#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:07:42,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {35033#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35034#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:07:42,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {35034#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35035#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:07:42,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {35035#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35036#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:07:42,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {35036#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35037#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:07:42,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {35037#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35038#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:07:42,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {35038#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35039#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:07:42,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {35039#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35040#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:07:42,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {35040#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35041#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:07:42,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {35041#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35042#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:07:42,721 INFO L290 TraceCheckUtils]: 44: Hoare triple {35042#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35043#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:07:42,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {35043#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35044#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:07:42,722 INFO L290 TraceCheckUtils]: 46: Hoare triple {35044#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35045#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:07:42,722 INFO L290 TraceCheckUtils]: 47: Hoare triple {35045#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35046#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:07:42,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {35046#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35047#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:07:42,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {35047#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35048#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:07:42,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {35048#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35049#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:07:42,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {35049#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35050#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:07:42,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {35050#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35051#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:07:42,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {35051#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35052#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:07:42,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {35052#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35053#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:07:42,726 INFO L290 TraceCheckUtils]: 55: Hoare triple {35053#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35054#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:07:42,727 INFO L290 TraceCheckUtils]: 56: Hoare triple {35054#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35055#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:07:42,727 INFO L290 TraceCheckUtils]: 57: Hoare triple {35055#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35056#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:07:42,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {35056#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35057#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:07:42,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {35057#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35058#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:07:42,729 INFO L290 TraceCheckUtils]: 60: Hoare triple {35058#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35059#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:07:42,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {35059#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35060#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:07:42,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {35060#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35252#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:07:42,730 INFO L290 TraceCheckUtils]: 63: Hoare triple {35252#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {35000#false} is VALID [2022-04-15 06:07:42,730 INFO L272 TraceCheckUtils]: 64: Hoare triple {35000#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {35000#false} is VALID [2022-04-15 06:07:42,730 INFO L290 TraceCheckUtils]: 65: Hoare triple {35000#false} ~cond := #in~cond; {35000#false} is VALID [2022-04-15 06:07:42,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {35000#false} assume 0 == ~cond; {35000#false} is VALID [2022-04-15 06:07:42,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {35000#false} assume !false; {35000#false} is VALID [2022-04-15 06:07:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:42,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 67: Hoare triple {35000#false} assume !false; {35000#false} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {35000#false} assume 0 == ~cond; {35000#false} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 65: Hoare triple {35000#false} ~cond := #in~cond; {35000#false} is VALID [2022-04-15 06:07:48,852 INFO L272 TraceCheckUtils]: 64: Hoare triple {35000#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {35000#false} is VALID [2022-04-15 06:07:48,852 INFO L290 TraceCheckUtils]: 63: Hoare triple {35280#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {35000#false} is VALID [2022-04-15 06:07:48,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {35284#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35280#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {35288#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35284#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,855 INFO L290 TraceCheckUtils]: 60: Hoare triple {35292#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35288#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,856 INFO L290 TraceCheckUtils]: 59: Hoare triple {35296#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35292#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,857 INFO L290 TraceCheckUtils]: 58: Hoare triple {35300#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35296#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {35304#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35300#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,858 INFO L290 TraceCheckUtils]: 56: Hoare triple {35308#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35304#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {35312#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35308#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {35316#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35312#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {35320#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35316#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {35324#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35320#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,862 INFO L290 TraceCheckUtils]: 51: Hoare triple {35328#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35324#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {35332#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35328#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {35336#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35332#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {35340#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35336#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {35344#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35340#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {35348#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35344#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {35352#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35348#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,868 INFO L290 TraceCheckUtils]: 44: Hoare triple {35356#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35352#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {35360#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35356#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {35364#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35360#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {35368#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35364#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {35372#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35368#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {35376#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35372#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {35380#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35376#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {35384#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35380#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {35388#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35384#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {35392#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35388#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {35396#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35392#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {35400#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35396#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {35404#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35400#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {35408#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35404#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {35412#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35408#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {35416#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35412#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {35420#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35416#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {35424#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35420#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {35428#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35424#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {35432#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35428#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {35436#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35432#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {35440#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35436#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {35444#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35440#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {35448#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35444#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {35452#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35448#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {35456#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35452#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {35460#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35456#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {35464#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35460#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {35468#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35464#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {35472#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35468#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {35476#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35472#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {35480#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35476#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {35484#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35480#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {35488#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35484#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {35492#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35488#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {35496#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35492#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {35500#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35496#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {35504#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35500#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {35508#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35504#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {34999#true} ~x~0 := 0; {35508#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-15 06:07:48,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {34999#true} call #t~ret4 := main(); {34999#true} is VALID [2022-04-15 06:07:48,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34999#true} {34999#true} #34#return; {34999#true} is VALID [2022-04-15 06:07:48,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {34999#true} assume true; {34999#true} is VALID [2022-04-15 06:07:48,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {34999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34999#true} is VALID [2022-04-15 06:07:48,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {34999#true} call ULTIMATE.init(); {34999#true} is VALID [2022-04-15 06:07:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:48,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899303662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:48,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:48,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 120 [2022-04-15 06:07:48,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:48,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [369261656] [2022-04-15 06:07:48,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [369261656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:48,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:48,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-15 06:07:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670122564] [2022-04-15 06:07:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:48,905 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 06:07:48,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:48,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:48,990 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-15 06:07:48,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-15 06:07:48,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:48,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-15 06:07:48,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3717, Invalid=10563, Unknown=0, NotChecked=0, Total=14280 [2022-04-15 06:07:48,992 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:56,299 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-15 06:07:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 06:07:56,300 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 06:07:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-04-15 06:07:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-04-15 06:07:56,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 75 transitions. [2022-04-15 06:07:56,362 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-15 06:07:56,362 INFO L225 Difference]: With dead ends: 75 [2022-04-15 06:07:56,362 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 06:07:56,364 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1773 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=7427, Invalid=24079, Unknown=0, NotChecked=0, Total=31506 [2022-04-15 06:07:56,364 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 3645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:56,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 233 Invalid, 3645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 06:07:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 06:07:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 06:07:56,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:56,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:56,445 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:56,445 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:56,446 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 06:07:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-15 06:07:56,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:56,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:56,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-15 06:07:56,447 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-15 06:07:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:56,454 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 06:07:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-15 06:07:56,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:56,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:56,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:56,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:56,454 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-15 06:07:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2022-04-15 06:07:56,455 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2022-04-15 06:07:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:56,455 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2022-04-15 06:07:56,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:56,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 70 transitions. [2022-04-15 06:07:56,507 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-15 06:07:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-15 06:07:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 06:07:56,508 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:56,508 INFO L499 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:56,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2022-04-15 06:07:56,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2022-04-15 06:07:56,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:56,908 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1525786084, now seen corresponding path program 115 times [2022-04-15 06:07:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:56,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1587329393] [2022-04-15 06:07:57,054 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:57,055 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:07:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1501696823, now seen corresponding path program 1 times [2022-04-15 06:07:57,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:57,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861092077] [2022-04-15 06:07:57,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:57,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:57,061 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_58.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_58.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:07:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:07:57,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781917594] [2022-04-15 06:07:57,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:57,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:57,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:57,064 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:07:57,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-04-15 06:07:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:57,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:07:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:57,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:07:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1525786084, now seen corresponding path program 116 times [2022-04-15 06:07:57,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:57,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932864525] [2022-04-15 06:07:57,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:57,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:59,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:59,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {36139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36075#true} is VALID [2022-04-15 06:07:59,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {36075#true} assume true; {36075#true} is VALID [2022-04-15 06:07:59,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36075#true} {36075#true} #34#return; {36075#true} is VALID [2022-04-15 06:07:59,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {36075#true} call ULTIMATE.init(); {36139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:59,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {36139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36075#true} is VALID [2022-04-15 06:07:59,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {36075#true} assume true; {36075#true} is VALID [2022-04-15 06:07:59,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36075#true} {36075#true} #34#return; {36075#true} is VALID [2022-04-15 06:07:59,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {36075#true} call #t~ret4 := main(); {36075#true} is VALID [2022-04-15 06:07:59,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {36075#true} ~x~0 := 0; {36080#(= main_~x~0 0)} is VALID [2022-04-15 06:07:59,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {36080#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36081#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:59,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {36081#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:07:59,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {36082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36083#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:07:59,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {36083#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36084#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:07:59,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {36084#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:07:59,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {36085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36086#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:07:59,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {36086#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36087#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:07:59,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {36087#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36088#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:07:59,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {36088#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36089#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:07:59,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {36089#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36090#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:07:59,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {36090#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36091#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:07:59,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {36091#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36092#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:07:59,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {36092#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36093#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:07:59,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {36093#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36094#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:07:59,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {36094#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36095#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:07:59,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {36095#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36096#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:07:59,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {36096#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36097#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:07:59,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {36097#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36098#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:07:59,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {36098#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36099#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:07:59,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {36099#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36100#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:07:59,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {36100#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36101#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:07:59,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {36101#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36102#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:07:59,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {36102#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36103#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:07:59,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {36103#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36104#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:07:59,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {36104#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36105#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:07:59,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {36105#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36106#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:07:59,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {36106#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36107#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:07:59,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {36107#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36108#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:07:59,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {36108#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36109#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:07:59,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {36109#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36110#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:07:59,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {36110#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36111#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:07:59,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {36111#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36112#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:07:59,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {36112#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36113#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:07:59,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {36113#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36114#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:07:59,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {36114#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36115#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:07:59,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {36115#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36116#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:07:59,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {36116#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36117#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:07:59,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {36117#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36118#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:07:59,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {36118#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36119#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:07:59,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {36119#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36120#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:07:59,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {36120#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36121#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:07:59,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {36121#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36122#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:07:59,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {36122#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36123#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:07:59,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {36123#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36124#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:07:59,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {36124#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36125#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:07:59,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {36125#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36126#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:07:59,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {36126#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36127#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:07:59,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {36127#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36128#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:07:59,093 INFO L290 TraceCheckUtils]: 54: Hoare triple {36128#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36129#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:07:59,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {36129#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36130#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:07:59,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {36130#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36131#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:07:59,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {36131#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36132#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:07:59,095 INFO L290 TraceCheckUtils]: 58: Hoare triple {36132#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36133#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:07:59,095 INFO L290 TraceCheckUtils]: 59: Hoare triple {36133#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36134#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:07:59,096 INFO L290 TraceCheckUtils]: 60: Hoare triple {36134#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36135#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:07:59,096 INFO L290 TraceCheckUtils]: 61: Hoare triple {36135#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36136#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:07:59,097 INFO L290 TraceCheckUtils]: 62: Hoare triple {36136#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36137#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:07:59,097 INFO L290 TraceCheckUtils]: 63: Hoare triple {36137#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36138#(and (<= main_~x~0 116) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:07:59,097 INFO L290 TraceCheckUtils]: 64: Hoare triple {36138#(and (<= main_~x~0 116) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {36076#false} is VALID [2022-04-15 06:07:59,098 INFO L272 TraceCheckUtils]: 65: Hoare triple {36076#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {36076#false} is VALID [2022-04-15 06:07:59,098 INFO L290 TraceCheckUtils]: 66: Hoare triple {36076#false} ~cond := #in~cond; {36076#false} is VALID [2022-04-15 06:07:59,098 INFO L290 TraceCheckUtils]: 67: Hoare triple {36076#false} assume 0 == ~cond; {36076#false} is VALID [2022-04-15 06:07:59,098 INFO L290 TraceCheckUtils]: 68: Hoare triple {36076#false} assume !false; {36076#false} is VALID [2022-04-15 06:07:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:59,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:59,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932864525] [2022-04-15 06:07:59,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932864525] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:59,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037815752] [2022-04-15 06:07:59,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:07:59,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:59,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:59,099 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:07:59,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-04-15 06:07:59,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:07:59,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:59,178 WARN L261 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 119 conjunts are in the unsatisfiable core [2022-04-15 06:07:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:59,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:59,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {36075#true} call ULTIMATE.init(); {36075#true} is VALID [2022-04-15 06:07:59,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {36075#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36075#true} is VALID [2022-04-15 06:07:59,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {36075#true} assume true; {36075#true} is VALID [2022-04-15 06:07:59,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36075#true} {36075#true} #34#return; {36075#true} is VALID [2022-04-15 06:07:59,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {36075#true} call #t~ret4 := main(); {36075#true} is VALID [2022-04-15 06:07:59,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {36075#true} ~x~0 := 0; {36080#(= main_~x~0 0)} is VALID [2022-04-15 06:07:59,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {36080#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36081#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:59,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {36081#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:07:59,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {36082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36083#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:07:59,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {36083#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36084#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:07:59,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {36084#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:07:59,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {36085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36086#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:07:59,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {36086#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36087#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:07:59,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {36087#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36088#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:07:59,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {36088#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36089#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:07:59,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {36089#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36090#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:07:59,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {36090#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36091#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:07:59,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {36091#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36092#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:07:59,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {36092#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36093#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:07:59,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {36093#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36094#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:07:59,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {36094#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36095#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:07:59,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {36095#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36096#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:07:59,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {36096#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36097#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:07:59,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {36097#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36098#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:07:59,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {36098#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36099#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:07:59,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {36099#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36100#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:07:59,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {36100#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36101#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:07:59,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {36101#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36102#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:07:59,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {36102#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36103#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:07:59,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {36103#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36104#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:07:59,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {36104#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36105#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:07:59,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {36105#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36106#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:07:59,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {36106#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36107#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:07:59,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {36107#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36108#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:07:59,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {36108#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36109#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:07:59,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {36109#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36110#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:07:59,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {36110#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36111#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:07:59,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {36111#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36112#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:07:59,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {36112#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36113#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:07:59,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {36113#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36114#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:07:59,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {36114#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36115#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:07:59,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {36115#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36116#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:07:59,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {36116#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36117#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:07:59,914 INFO L290 TraceCheckUtils]: 43: Hoare triple {36117#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36118#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:07:59,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {36118#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36119#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:07:59,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {36119#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36120#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:07:59,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {36120#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36121#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:07:59,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {36121#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36122#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:07:59,917 INFO L290 TraceCheckUtils]: 48: Hoare triple {36122#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36123#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:07:59,917 INFO L290 TraceCheckUtils]: 49: Hoare triple {36123#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36124#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:07:59,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {36124#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36125#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:07:59,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {36125#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36126#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:07:59,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {36126#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36127#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:07:59,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {36127#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36128#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:07:59,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {36128#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36129#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:07:59,920 INFO L290 TraceCheckUtils]: 55: Hoare triple {36129#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36130#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:07:59,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {36130#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36131#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:07:59,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {36131#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36132#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:07:59,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {36132#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36133#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:07:59,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {36133#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36134#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:07:59,923 INFO L290 TraceCheckUtils]: 60: Hoare triple {36134#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36135#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:07:59,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {36135#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36136#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:07:59,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {36136#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36137#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:07:59,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {36137#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36332#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:07:59,924 INFO L290 TraceCheckUtils]: 64: Hoare triple {36332#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {36076#false} is VALID [2022-04-15 06:07:59,925 INFO L272 TraceCheckUtils]: 65: Hoare triple {36076#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {36076#false} is VALID [2022-04-15 06:07:59,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {36076#false} ~cond := #in~cond; {36076#false} is VALID [2022-04-15 06:07:59,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {36076#false} assume 0 == ~cond; {36076#false} is VALID [2022-04-15 06:07:59,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {36076#false} assume !false; {36076#false} is VALID [2022-04-15 06:07:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:59,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:08:05,324 INFO L290 TraceCheckUtils]: 68: Hoare triple {36076#false} assume !false; {36076#false} is VALID [2022-04-15 06:08:05,324 INFO L290 TraceCheckUtils]: 67: Hoare triple {36076#false} assume 0 == ~cond; {36076#false} is VALID [2022-04-15 06:08:05,324 INFO L290 TraceCheckUtils]: 66: Hoare triple {36076#false} ~cond := #in~cond; {36076#false} is VALID [2022-04-15 06:08:05,324 INFO L272 TraceCheckUtils]: 65: Hoare triple {36076#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {36076#false} is VALID [2022-04-15 06:08:05,324 INFO L290 TraceCheckUtils]: 64: Hoare triple {36360#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {36076#false} is VALID [2022-04-15 06:08:05,325 INFO L290 TraceCheckUtils]: 63: Hoare triple {36364#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36360#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,326 INFO L290 TraceCheckUtils]: 62: Hoare triple {36368#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36364#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {36372#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36368#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,327 INFO L290 TraceCheckUtils]: 60: Hoare triple {36376#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36372#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,328 INFO L290 TraceCheckUtils]: 59: Hoare triple {36380#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36376#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,328 INFO L290 TraceCheckUtils]: 58: Hoare triple {36384#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36380#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {36388#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36384#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {36392#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36388#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {36396#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36392#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {36400#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36396#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,331 INFO L290 TraceCheckUtils]: 53: Hoare triple {36404#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36400#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {36408#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36404#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {36412#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36408#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {36416#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36412#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {36420#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36416#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {36424#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36420#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {36428#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36424#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {36432#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36428#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {36436#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36432#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {36440#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36436#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {36444#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36440#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {36448#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36444#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {36452#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36448#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,340 INFO L290 TraceCheckUtils]: 40: Hoare triple {36456#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36452#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {36460#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36456#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {36464#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36460#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {36468#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36464#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {36472#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36468#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {36476#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36472#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {36480#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36476#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {36484#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36480#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {36488#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36484#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {36492#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36488#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {36496#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36492#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {36500#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36496#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {36504#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36500#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {36508#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36504#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {36512#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36508#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {36516#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36512#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {36520#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36516#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {36524#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36520#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {36528#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36524#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {36532#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36528#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {36536#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36532#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {36540#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36536#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {36544#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36540#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {36548#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36544#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {36552#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36548#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {36556#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36552#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {36560#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36556#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {36564#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36560#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {36568#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36564#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {36572#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36568#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {36576#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36572#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {36580#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36576#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {36584#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36580#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {36588#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36584#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {36592#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36588#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {36075#true} ~x~0 := 0; {36592#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:05,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {36075#true} call #t~ret4 := main(); {36075#true} is VALID [2022-04-15 06:08:05,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36075#true} {36075#true} #34#return; {36075#true} is VALID [2022-04-15 06:08:05,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {36075#true} assume true; {36075#true} is VALID [2022-04-15 06:08:05,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {36075#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36075#true} is VALID [2022-04-15 06:08:05,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {36075#true} call ULTIMATE.init(); {36075#true} is VALID [2022-04-15 06:08:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:08:05,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037815752] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:08:05,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:08:05,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 122 [2022-04-15 06:08:05,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:08:05,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1587329393] [2022-04-15 06:08:05,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1587329393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:05,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:05,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 06:08:05,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114504917] [2022-04-15 06:08:05,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:08:05,364 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 06:08:05,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:08:05,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:05,401 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-15 06:08:05,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 06:08:05,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:05,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 06:08:05,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3840, Invalid=10922, Unknown=0, NotChecked=0, Total=14762 [2022-04-15 06:08:05,403 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:12,177 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-15 06:08:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 06:08:12,178 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 06:08:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-15 06:08:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-15 06:08:12,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 76 transitions. [2022-04-15 06:08:12,241 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-15 06:08:12,242 INFO L225 Difference]: With dead ends: 76 [2022-04-15 06:08:12,242 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 06:08:12,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=7673, Invalid=24907, Unknown=0, NotChecked=0, Total=32580 [2022-04-15 06:08:12,243 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3509 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:08:12,243 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 3628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3509 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 06:08:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 06:08:12,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 06:08:12,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:12,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:12,320 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:12,320 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:12,320 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-15 06:08:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-15 06:08:12,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:12,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:12,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 06:08:12,321 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 06:08:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:12,321 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-15 06:08:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-15 06:08:12,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:12,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:12,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:12,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-15 06:08:12,322 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2022-04-15 06:08:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:12,322 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-15 06:08:12,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:12,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-15 06:08:12,374 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-15 06:08:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-15 06:08:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 06:08:12,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:12,375 INFO L499 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:12,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2022-04-15 06:08:12,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2022-04-15 06:08:12,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:12,776 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash -18267082, now seen corresponding path program 117 times [2022-04-15 06:08:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:12,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1238873322] [2022-04-15 06:08:16,550 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:08:16,551 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:08:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1560802167, now seen corresponding path program 1 times [2022-04-15 06:08:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:16,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226225852] [2022-04-15 06:08:16,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:16,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:16,557 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_59.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_59.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:08:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:08:16,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713134608] [2022-04-15 06:08:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:16,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:16,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:16,562 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:08:16,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-04-15 06:08:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:08:16,612 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:08:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:08:16,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:08:16,622 INFO L85 PathProgramCache]: Analyzing trace with hash -18267082, now seen corresponding path program 118 times [2022-04-15 06:08:16,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:16,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204509458] [2022-04-15 06:08:16,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:16,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:18,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:18,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {37232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37167#true} is VALID [2022-04-15 06:08:18,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {37167#true} assume true; {37167#true} is VALID [2022-04-15 06:08:18,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37167#true} {37167#true} #34#return; {37167#true} is VALID [2022-04-15 06:08:18,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {37167#true} call ULTIMATE.init(); {37232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:08:18,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {37232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37167#true} is VALID [2022-04-15 06:08:18,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {37167#true} assume true; {37167#true} is VALID [2022-04-15 06:08:18,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37167#true} {37167#true} #34#return; {37167#true} is VALID [2022-04-15 06:08:18,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {37167#true} call #t~ret4 := main(); {37167#true} is VALID [2022-04-15 06:08:18,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {37167#true} ~x~0 := 0; {37172#(= main_~x~0 0)} is VALID [2022-04-15 06:08:18,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {37172#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37173#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:08:18,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {37173#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37174#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:08:18,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {37174#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37175#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:08:18,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {37175#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37176#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:08:18,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {37176#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37177#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:08:18,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {37177#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37178#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:08:18,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {37178#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37179#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:08:18,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {37179#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37180#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:08:18,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {37180#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37181#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:08:18,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {37181#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37182#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:08:18,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {37182#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37183#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:08:18,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {37183#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37184#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:08:18,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {37184#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37185#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:08:18,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {37185#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37186#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:08:18,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {37186#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37187#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:08:18,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {37187#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37188#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:08:18,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {37188#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37189#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:08:18,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {37189#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37190#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:08:18,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {37190#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37191#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:08:18,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {37191#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37192#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:08:18,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {37192#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37193#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:08:18,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {37193#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37194#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:08:18,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {37194#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37195#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:08:18,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {37195#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37196#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:08:18,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {37196#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37197#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:08:18,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {37197#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37198#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:08:18,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {37198#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37199#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:08:18,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {37199#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37200#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:08:18,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {37200#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37201#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:08:18,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {37201#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37202#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:08:18,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {37202#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37203#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:08:18,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {37203#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37204#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:08:18,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {37204#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37205#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:08:18,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {37205#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37206#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:08:18,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {37206#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37207#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:08:18,397 INFO L290 TraceCheckUtils]: 41: Hoare triple {37207#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37208#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:08:18,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {37208#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37209#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:08:18,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {37209#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37210#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:08:18,398 INFO L290 TraceCheckUtils]: 44: Hoare triple {37210#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37211#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:08:18,398 INFO L290 TraceCheckUtils]: 45: Hoare triple {37211#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37212#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:08:18,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {37212#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37213#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:08:18,399 INFO L290 TraceCheckUtils]: 47: Hoare triple {37213#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37214#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:08:18,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {37214#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37215#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:08:18,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {37215#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37216#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:08:18,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {37216#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37217#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:08:18,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {37217#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37218#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:08:18,402 INFO L290 TraceCheckUtils]: 52: Hoare triple {37218#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37219#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:08:18,402 INFO L290 TraceCheckUtils]: 53: Hoare triple {37219#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37220#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:08:18,403 INFO L290 TraceCheckUtils]: 54: Hoare triple {37220#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37221#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:08:18,403 INFO L290 TraceCheckUtils]: 55: Hoare triple {37221#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37222#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:08:18,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {37222#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37223#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:08:18,404 INFO L290 TraceCheckUtils]: 57: Hoare triple {37223#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37224#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:08:18,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {37224#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37225#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:08:18,405 INFO L290 TraceCheckUtils]: 59: Hoare triple {37225#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37226#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:08:18,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {37226#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37227#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:08:18,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {37227#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37228#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:08:18,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {37228#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37229#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:08:18,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {37229#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37230#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:08:18,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {37230#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37231#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 118))} is VALID [2022-04-15 06:08:18,408 INFO L290 TraceCheckUtils]: 65: Hoare triple {37231#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 118))} assume !(~x~0 % 4294967296 < 268435455); {37168#false} is VALID [2022-04-15 06:08:18,408 INFO L272 TraceCheckUtils]: 66: Hoare triple {37168#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {37168#false} is VALID [2022-04-15 06:08:18,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {37168#false} ~cond := #in~cond; {37168#false} is VALID [2022-04-15 06:08:18,408 INFO L290 TraceCheckUtils]: 68: Hoare triple {37168#false} assume 0 == ~cond; {37168#false} is VALID [2022-04-15 06:08:18,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {37168#false} assume !false; {37168#false} is VALID [2022-04-15 06:08:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:08:18,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:18,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204509458] [2022-04-15 06:08:18,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204509458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:18,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863315267] [2022-04-15 06:08:18,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:08:18,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:18,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:18,410 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:08:18,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-04-15 06:08:18,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:08:18,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:08:18,527 WARN L261 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 121 conjunts are in the unsatisfiable core [2022-04-15 06:08:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:18,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:08:19,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {37167#true} call ULTIMATE.init(); {37167#true} is VALID [2022-04-15 06:08:19,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {37167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37167#true} is VALID [2022-04-15 06:08:19,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {37167#true} assume true; {37167#true} is VALID [2022-04-15 06:08:19,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37167#true} {37167#true} #34#return; {37167#true} is VALID [2022-04-15 06:08:19,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {37167#true} call #t~ret4 := main(); {37167#true} is VALID [2022-04-15 06:08:19,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {37167#true} ~x~0 := 0; {37172#(= main_~x~0 0)} is VALID [2022-04-15 06:08:19,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {37172#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37173#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:08:19,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {37173#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37174#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:08:19,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {37174#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37175#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:08:19,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {37175#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37176#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:08:19,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {37176#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37177#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:08:19,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {37177#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37178#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:08:19,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {37178#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37179#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:08:19,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {37179#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37180#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:08:19,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {37180#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37181#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:08:19,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {37181#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37182#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:08:19,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {37182#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37183#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:08:19,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {37183#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37184#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:08:19,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {37184#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37185#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:08:19,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {37185#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37186#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:08:19,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {37186#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37187#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:08:19,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {37187#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37188#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:08:19,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {37188#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37189#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:08:19,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {37189#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37190#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:08:19,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {37190#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37191#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:08:19,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {37191#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37192#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:08:19,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {37192#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37193#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:08:19,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {37193#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37194#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:08:19,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {37194#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37195#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:08:19,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {37195#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37196#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:08:19,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {37196#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37197#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:08:19,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {37197#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37198#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:08:19,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {37198#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37199#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:08:19,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {37199#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37200#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:08:19,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {37200#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37201#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:08:19,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {37201#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37202#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:08:19,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {37202#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37203#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:08:19,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {37203#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37204#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:08:19,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {37204#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37205#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:08:19,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {37205#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37206#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:08:19,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {37206#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37207#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:08:19,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {37207#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37208#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:08:19,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {37208#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37209#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:08:19,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {37209#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37210#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:08:19,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {37210#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37211#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:08:19,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {37211#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37212#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:08:19,253 INFO L290 TraceCheckUtils]: 46: Hoare triple {37212#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37213#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:08:19,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {37213#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37214#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:08:19,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {37214#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37215#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:08:19,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {37215#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37216#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:08:19,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {37216#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37217#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:08:19,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {37217#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37218#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:08:19,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {37218#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37219#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:08:19,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {37219#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37220#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:08:19,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {37220#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37221#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:08:19,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {37221#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37222#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:08:19,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {37222#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37223#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:08:19,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {37223#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37224#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:08:19,259 INFO L290 TraceCheckUtils]: 58: Hoare triple {37224#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37225#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:08:19,259 INFO L290 TraceCheckUtils]: 59: Hoare triple {37225#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37226#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:08:19,260 INFO L290 TraceCheckUtils]: 60: Hoare triple {37226#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37227#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:08:19,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {37227#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37228#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:08:19,261 INFO L290 TraceCheckUtils]: 62: Hoare triple {37228#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37229#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:08:19,261 INFO L290 TraceCheckUtils]: 63: Hoare triple {37229#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37230#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:08:19,262 INFO L290 TraceCheckUtils]: 64: Hoare triple {37230#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37428#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:08:19,262 INFO L290 TraceCheckUtils]: 65: Hoare triple {37428#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !(~x~0 % 4294967296 < 268435455); {37168#false} is VALID [2022-04-15 06:08:19,262 INFO L272 TraceCheckUtils]: 66: Hoare triple {37168#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {37168#false} is VALID [2022-04-15 06:08:19,262 INFO L290 TraceCheckUtils]: 67: Hoare triple {37168#false} ~cond := #in~cond; {37168#false} is VALID [2022-04-15 06:08:19,263 INFO L290 TraceCheckUtils]: 68: Hoare triple {37168#false} assume 0 == ~cond; {37168#false} is VALID [2022-04-15 06:08:19,263 INFO L290 TraceCheckUtils]: 69: Hoare triple {37168#false} assume !false; {37168#false} is VALID [2022-04-15 06:08:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:08:19,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:08:24,680 INFO L290 TraceCheckUtils]: 69: Hoare triple {37168#false} assume !false; {37168#false} is VALID [2022-04-15 06:08:24,680 INFO L290 TraceCheckUtils]: 68: Hoare triple {37168#false} assume 0 == ~cond; {37168#false} is VALID [2022-04-15 06:08:24,680 INFO L290 TraceCheckUtils]: 67: Hoare triple {37168#false} ~cond := #in~cond; {37168#false} is VALID [2022-04-15 06:08:24,681 INFO L272 TraceCheckUtils]: 66: Hoare triple {37168#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {37168#false} is VALID [2022-04-15 06:08:24,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {37456#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {37168#false} is VALID [2022-04-15 06:08:24,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {37460#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37456#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,682 INFO L290 TraceCheckUtils]: 63: Hoare triple {37464#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37460#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,683 INFO L290 TraceCheckUtils]: 62: Hoare triple {37468#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37464#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {37472#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37468#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {37476#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37472#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {37480#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37476#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {37484#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37480#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {37488#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37484#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {37492#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37488#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,690 INFO L290 TraceCheckUtils]: 55: Hoare triple {37496#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37492#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {37500#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37496#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {37504#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37500#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,692 INFO L290 TraceCheckUtils]: 52: Hoare triple {37508#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37504#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {37512#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37508#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {37516#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37512#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,694 INFO L290 TraceCheckUtils]: 49: Hoare triple {37520#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37516#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,694 INFO L290 TraceCheckUtils]: 48: Hoare triple {37524#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37520#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {37528#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37524#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {37532#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37528#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {37536#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37532#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {37540#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37536#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {37544#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37540#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {37548#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37544#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {37552#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37548#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {37556#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37552#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {37560#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37556#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {37564#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37560#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {37568#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37564#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {37572#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37568#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {37576#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37572#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {37580#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37576#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {37584#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37580#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {37588#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37584#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {37592#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37588#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {37596#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37592#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {37600#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37596#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {37604#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37600#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {37608#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37604#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {37612#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37608#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {37616#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37612#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {37620#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37616#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {37624#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37620#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {37628#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37624#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {37632#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37628#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {37636#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37632#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {37640#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37636#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {37644#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37640#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {37648#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37644#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {37652#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37648#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {37656#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37652#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {37660#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37656#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {37664#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37660#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {37668#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37664#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {37672#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37668#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {37676#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37672#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {37680#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37676#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {37684#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37680#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {37688#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37684#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {37692#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37688#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {37167#true} ~x~0 := 0; {37692#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-15 06:08:24,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {37167#true} call #t~ret4 := main(); {37167#true} is VALID [2022-04-15 06:08:24,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37167#true} {37167#true} #34#return; {37167#true} is VALID [2022-04-15 06:08:24,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {37167#true} assume true; {37167#true} is VALID [2022-04-15 06:08:24,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {37167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37167#true} is VALID [2022-04-15 06:08:24,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {37167#true} call ULTIMATE.init(); {37167#true} is VALID [2022-04-15 06:08:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:08:24,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863315267] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:08:24,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:08:24,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 124 [2022-04-15 06:08:24,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:08:24,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1238873322] [2022-04-15 06:08:24,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1238873322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:24,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:24,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 06:08:24,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550174836] [2022-04-15 06:08:24,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:08:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 06:08:24,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:08:24,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:24,764 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-15 06:08:24,765 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 06:08:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:24,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 06:08:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3965, Invalid=11287, Unknown=0, NotChecked=0, Total=15252 [2022-04-15 06:08:24,766 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:33,961 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-15 06:08:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 06:08:33,962 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 06:08:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-15 06:08:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-15 06:08:33,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 77 transitions. [2022-04-15 06:08:34,020 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-15 06:08:34,021 INFO L225 Difference]: With dead ends: 77 [2022-04-15 06:08:34,021 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 06:08:34,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=7923, Invalid=25749, Unknown=0, NotChecked=0, Total=33672 [2022-04-15 06:08:34,023 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 3747 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 3868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:08:34,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 218 Invalid, 3868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3747 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 06:08:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 06:08:34,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-04-15 06:08:34,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:34,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:34,117 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:34,117 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:34,117 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 06:08:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-15 06:08:34,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:34,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:34,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 06:08:34,118 INFO L87 Difference]: Start difference. First operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 06:08:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:34,119 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 06:08:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-15 06:08:34,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:34,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:34,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:34,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:34,119 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-15 06:08:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2022-04-15 06:08:34,120 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2022-04-15 06:08:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:34,120 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2022-04-15 06:08:34,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:08:34,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 72 transitions. [2022-04-15 06:08:34,185 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-15 06:08:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-15 06:08:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 06:08:34,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:34,186 INFO L499 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:34,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2022-04-15 06:08:34,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2022-04-15 06:08:34,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable119,SelfDestructingSolverStorable118,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:34,586 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:34,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:34,587 INFO L85 PathProgramCache]: Analyzing trace with hash -529818276, now seen corresponding path program 119 times [2022-04-15 06:08:34,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:34,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [772113904] [2022-04-15 06:08:34,767 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:08:34,769 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:08:34,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1619907511, now seen corresponding path program 1 times [2022-04-15 06:08:34,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:34,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067781194] [2022-04-15 06:08:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:34,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:34,775 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_60.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_60.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:08:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:08:34,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [292067216] [2022-04-15 06:08:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:34,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:34,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:34,782 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:08:34,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-04-15 06:08:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:08:34,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:08:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:08:34,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:08:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash -529818276, now seen corresponding path program 120 times [2022-04-15 06:08:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:34,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114252379] [2022-04-15 06:08:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:34,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:37,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:37,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {38341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {38275#true} is VALID [2022-04-15 06:08:37,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {38275#true} assume true; {38275#true} is VALID [2022-04-15 06:08:37,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38275#true} {38275#true} #34#return; {38275#true} is VALID [2022-04-15 06:08:37,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {38275#true} call ULTIMATE.init(); {38341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:08:37,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {38341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {38275#true} is VALID [2022-04-15 06:08:37,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {38275#true} assume true; {38275#true} is VALID [2022-04-15 06:08:37,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38275#true} {38275#true} #34#return; {38275#true} is VALID [2022-04-15 06:08:37,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {38275#true} call #t~ret4 := main(); {38275#true} is VALID [2022-04-15 06:08:37,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {38275#true} ~x~0 := 0; {38280#(= main_~x~0 0)} is VALID [2022-04-15 06:08:37,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {38280#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38281#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:08:37,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {38281#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38282#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:08:37,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {38282#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38283#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:08:37,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {38283#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38284#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:08:37,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {38284#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:08:37,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {38285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38286#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:08:37,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {38286#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38287#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:08:37,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {38287#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:08:37,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {38288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38289#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:08:37,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {38289#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38290#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:08:37,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {38290#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:08:37,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {38291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38292#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:08:37,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {38292#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38293#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:08:37,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {38293#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38294#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:08:37,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {38294#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38295#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:08:37,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {38295#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38296#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:08:37,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {38296#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38297#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:08:37,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {38297#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38298#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:08:37,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {38298#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38299#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:08:37,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {38299#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38300#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:08:37,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {38300#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38301#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:08:37,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {38301#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38302#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:08:37,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {38302#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38303#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:08:37,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {38303#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38304#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:08:37,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {38304#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38305#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:08:37,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {38305#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38306#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:08:37,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {38306#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38307#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:08:37,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {38307#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38308#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:08:37,115 INFO L290 TraceCheckUtils]: 34: Hoare triple {38308#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38309#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:08:37,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {38309#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38310#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:08:37,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {38310#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38311#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:08:37,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {38311#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38312#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:08:37,117 INFO L290 TraceCheckUtils]: 38: Hoare triple {38312#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38313#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:08:37,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {38313#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38314#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:08:37,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {38314#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38315#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:08:37,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {38315#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38316#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:08:37,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {38316#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38317#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:08:37,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {38317#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38318#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:08:37,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {38318#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38319#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:08:37,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {38319#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38320#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:08:37,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {38320#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38321#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:08:37,123 INFO L290 TraceCheckUtils]: 47: Hoare triple {38321#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38322#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:08:37,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {38322#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38323#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:08:37,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {38323#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38324#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:08:37,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {38324#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38325#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:08:37,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {38325#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38326#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:08:37,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {38326#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38327#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:08:37,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {38327#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38328#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:08:37,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {38328#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38329#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:08:37,127 INFO L290 TraceCheckUtils]: 55: Hoare triple {38329#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38330#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:08:37,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {38330#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38331#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:08:37,129 INFO L290 TraceCheckUtils]: 57: Hoare triple {38331#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38332#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:08:37,129 INFO L290 TraceCheckUtils]: 58: Hoare triple {38332#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38333#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:08:37,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {38333#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38334#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:08:37,131 INFO L290 TraceCheckUtils]: 60: Hoare triple {38334#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38335#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:08:37,131 INFO L290 TraceCheckUtils]: 61: Hoare triple {38335#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38336#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:08:37,132 INFO L290 TraceCheckUtils]: 62: Hoare triple {38336#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38337#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:08:37,132 INFO L290 TraceCheckUtils]: 63: Hoare triple {38337#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38338#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:08:37,133 INFO L290 TraceCheckUtils]: 64: Hoare triple {38338#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38339#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:08:37,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {38339#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38340#(and (<= main_~x~0 120) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:08:37,134 INFO L290 TraceCheckUtils]: 66: Hoare triple {38340#(and (<= main_~x~0 120) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {38276#false} is VALID [2022-04-15 06:08:37,134 INFO L272 TraceCheckUtils]: 67: Hoare triple {38276#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {38276#false} is VALID [2022-04-15 06:08:37,134 INFO L290 TraceCheckUtils]: 68: Hoare triple {38276#false} ~cond := #in~cond; {38276#false} is VALID [2022-04-15 06:08:37,134 INFO L290 TraceCheckUtils]: 69: Hoare triple {38276#false} assume 0 == ~cond; {38276#false} is VALID [2022-04-15 06:08:37,135 INFO L290 TraceCheckUtils]: 70: Hoare triple {38276#false} assume !false; {38276#false} is VALID [2022-04-15 06:08:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:08:37,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:37,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114252379] [2022-04-15 06:08:37,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114252379] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:37,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210834867] [2022-04-15 06:08:37,136 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:08:37,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:37,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:37,140 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:08:37,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-04-15 06:09:15,111 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-15 06:09:15,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:09:15,151 WARN L261 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 129 conjunts are in the unsatisfiable core [2022-04-15 06:09:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:15,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:09:15,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {38275#true} call ULTIMATE.init(); {38275#true} is VALID [2022-04-15 06:09:15,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {38275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {38275#true} is VALID [2022-04-15 06:09:15,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {38275#true} assume true; {38275#true} is VALID [2022-04-15 06:09:15,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38275#true} {38275#true} #34#return; {38275#true} is VALID [2022-04-15 06:09:15,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {38275#true} call #t~ret4 := main(); {38275#true} is VALID [2022-04-15 06:09:15,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {38275#true} ~x~0 := 0; {38280#(= main_~x~0 0)} is VALID [2022-04-15 06:09:15,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {38280#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38281#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:09:15,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {38281#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38282#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:09:15,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {38282#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38283#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:09:15,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {38283#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38284#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:09:15,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {38284#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:09:15,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {38285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38286#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:09:15,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {38286#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38287#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:09:15,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {38287#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:09:15,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {38288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38289#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:09:15,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {38289#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38290#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:09:15,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {38290#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:09:15,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {38291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38292#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:09:15,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {38292#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38293#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:09:15,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {38293#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38294#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:09:15,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {38294#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38295#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:09:15,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {38295#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38296#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:09:15,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {38296#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38297#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:09:15,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {38297#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38298#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:09:15,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {38298#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38299#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:09:15,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {38299#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38300#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:09:15,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {38300#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38301#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:09:15,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {38301#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38302#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:09:15,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {38302#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38303#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:09:15,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {38303#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38304#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:09:15,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {38304#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38305#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:09:15,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {38305#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38306#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:09:15,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {38306#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38307#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:09:15,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {38307#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38308#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:09:15,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {38308#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38309#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:09:15,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {38309#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38310#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:09:15,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {38310#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38311#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:09:15,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {38311#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38312#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:09:15,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {38312#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38313#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:09:15,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {38313#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38314#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:09:15,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {38314#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38315#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:09:15,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {38315#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38316#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:09:15,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {38316#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38317#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:09:15,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {38317#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38318#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:09:15,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {38318#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38319#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:09:15,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {38319#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38320#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:09:15,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {38320#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38321#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:09:15,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {38321#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38322#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:09:15,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {38322#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38323#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:09:15,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {38323#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38324#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:09:15,938 INFO L290 TraceCheckUtils]: 50: Hoare triple {38324#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38325#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:09:15,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {38325#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38326#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:09:15,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {38326#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38327#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:09:15,939 INFO L290 TraceCheckUtils]: 53: Hoare triple {38327#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38328#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:09:15,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {38328#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38329#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:09:15,941 INFO L290 TraceCheckUtils]: 55: Hoare triple {38329#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38330#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:09:15,941 INFO L290 TraceCheckUtils]: 56: Hoare triple {38330#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38331#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:09:15,942 INFO L290 TraceCheckUtils]: 57: Hoare triple {38331#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38332#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:09:15,942 INFO L290 TraceCheckUtils]: 58: Hoare triple {38332#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38333#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:09:15,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {38333#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38334#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:09:15,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {38334#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38335#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:09:15,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {38335#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38336#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:09:15,945 INFO L290 TraceCheckUtils]: 62: Hoare triple {38336#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38337#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:09:15,945 INFO L290 TraceCheckUtils]: 63: Hoare triple {38337#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38338#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:09:15,946 INFO L290 TraceCheckUtils]: 64: Hoare triple {38338#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38339#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:09:15,947 INFO L290 TraceCheckUtils]: 65: Hoare triple {38339#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38540#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:09:15,947 INFO L290 TraceCheckUtils]: 66: Hoare triple {38540#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {38276#false} is VALID [2022-04-15 06:09:15,947 INFO L272 TraceCheckUtils]: 67: Hoare triple {38276#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {38276#false} is VALID [2022-04-15 06:09:15,947 INFO L290 TraceCheckUtils]: 68: Hoare triple {38276#false} ~cond := #in~cond; {38276#false} is VALID [2022-04-15 06:09:15,947 INFO L290 TraceCheckUtils]: 69: Hoare triple {38276#false} assume 0 == ~cond; {38276#false} is VALID [2022-04-15 06:09:15,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {38276#false} assume !false; {38276#false} is VALID [2022-04-15 06:09:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:09:15,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:09:25,050 INFO L290 TraceCheckUtils]: 70: Hoare triple {38276#false} assume !false; {38276#false} is VALID [2022-04-15 06:09:25,050 INFO L290 TraceCheckUtils]: 69: Hoare triple {38559#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {38276#false} is VALID [2022-04-15 06:09:25,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {38563#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38559#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:09:25,051 INFO L272 TraceCheckUtils]: 67: Hoare triple {38567#(not (= (mod main_~x~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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {38563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:09:25,051 INFO L290 TraceCheckUtils]: 66: Hoare triple {38571#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {38567#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:09:25,052 INFO L290 TraceCheckUtils]: 65: Hoare triple {38575#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38571#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,053 INFO L290 TraceCheckUtils]: 64: Hoare triple {38579#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38575#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,054 INFO L290 TraceCheckUtils]: 63: Hoare triple {38583#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38579#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,054 INFO L290 TraceCheckUtils]: 62: Hoare triple {38587#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38583#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {38591#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38587#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {38595#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38591#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {38599#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38595#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {38603#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38599#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {38607#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38603#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {38611#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38607#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {38615#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38611#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {38619#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38615#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,063 INFO L290 TraceCheckUtils]: 53: Hoare triple {38623#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38619#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {38627#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38623#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {38631#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38627#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,067 INFO L290 TraceCheckUtils]: 50: Hoare triple {38635#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38631#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {38639#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38635#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {38643#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38639#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,070 INFO L290 TraceCheckUtils]: 47: Hoare triple {38647#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38643#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {38651#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38647#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,072 INFO L290 TraceCheckUtils]: 45: Hoare triple {38655#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38651#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {38659#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38655#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {38663#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38659#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {38667#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38663#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {38671#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38667#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {38675#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38671#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {38679#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38675#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {38683#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38679#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {38687#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38683#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {38691#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38687#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {38695#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38691#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {38699#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38695#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {38703#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38699#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {38707#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38703#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {38711#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38707#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {38715#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38711#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {38719#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38715#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {38723#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38719#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {38727#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38723#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {38731#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38727#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {38735#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38731#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {38739#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38735#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {38743#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38739#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {38747#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38743#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {38751#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38747#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {38755#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38751#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {38759#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38755#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {38763#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38759#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {38767#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38763#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {38771#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38767#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {38775#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38771#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {38779#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38775#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {38783#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38779#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {38787#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38783#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {38791#(or (< (mod (+ 110 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38787#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {38795#(or (< (mod (+ 112 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38791#(or (< (mod (+ 110 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {38799#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 114) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38795#(or (< (mod (+ 112 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {38803#(or (< (mod (+ 116 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38799#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 114) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {38807#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 118) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38803#(or (< (mod (+ 116 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {38811#(or (< (mod (+ main_~x~0 120) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38807#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 118) 4294967296) 268435455))} is VALID [2022-04-15 06:09:25,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {38275#true} ~x~0 := 0; {38811#(or (< (mod (+ main_~x~0 120) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:09:25,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {38275#true} call #t~ret4 := main(); {38275#true} is VALID [2022-04-15 06:09:25,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38275#true} {38275#true} #34#return; {38275#true} is VALID [2022-04-15 06:09:25,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {38275#true} assume true; {38275#true} is VALID [2022-04-15 06:09:25,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {38275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {38275#true} is VALID [2022-04-15 06:09:25,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {38275#true} call ULTIMATE.init(); {38275#true} is VALID [2022-04-15 06:09:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:09:25,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210834867] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:09:25,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:09:25,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 66] total 129 [2022-04-15 06:09:25,114 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:25,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [772113904] [2022-04-15 06:09:25,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [772113904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:25,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:25,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 06:09:25,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052687621] [2022-04-15 06:09:25,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:25,114 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-15 06:09:25,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:25,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:25,152 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-15 06:09:25,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 06:09:25,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:25,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 06:09:25,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12353, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 06:09:25,153 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:32,743 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-15 06:09:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 06:09:32,743 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-15 06:09:32,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:09:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-15 06:09:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-15 06:09:32,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 78 transitions. [2022-04-15 06:09:32,794 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-15 06:09:32,795 INFO L225 Difference]: With dead ends: 78 [2022-04-15 06:09:32,795 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 06:09:32,797 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=8244, Invalid=27666, Unknown=0, NotChecked=0, Total=35910 [2022-04-15 06:09:32,797 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 3962 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 4085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:09:32,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 313 Invalid, 4085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3962 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 06:09:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 06:09:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-15 06:09:32,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:09:32,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:32,877 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:32,877 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:32,878 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-15 06:09:32,878 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-15 06:09:32,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:32,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:32,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 06:09:32,878 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 06:09:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:32,879 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-15 06:09:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-15 06:09:32,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:32,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:32,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:09:32,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:09:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2022-04-15 06:09:32,880 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2022-04-15 06:09:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:09:32,880 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2022-04-15 06:09:32,880 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:32,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 73 transitions. [2022-04-15 06:09:32,941 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-15 06:09:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-15 06:09:32,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 06:09:32,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:09:32,941 INFO L499 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:09:32,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2022-04-15 06:09:33,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2022-04-15 06:09:33,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable121,121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:09:33,350 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:09:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:09:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 791963894, now seen corresponding path program 121 times [2022-04-15 06:09:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:33,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [466371814] [2022-04-15 06:09:33,516 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:09:33,517 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:09:33,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1679012855, now seen corresponding path program 1 times [2022-04-15 06:09:33,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:33,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753241058] [2022-04-15 06:09:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:33,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:33,523 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_61.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_61.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:09:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:09:33,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826807721] [2022-04-15 06:09:33,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:33,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:09:33,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:09:33,536 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:09:33,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-04-15 06:09:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:09:33,602 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:09:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:09:33,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:09:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash 791963894, now seen corresponding path program 122 times [2022-04-15 06:09:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:33,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407812727] [2022-04-15 06:09:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:33,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:35,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:09:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:35,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {39469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39402#true} is VALID [2022-04-15 06:09:35,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {39402#true} assume true; {39402#true} is VALID [2022-04-15 06:09:35,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39402#true} {39402#true} #34#return; {39402#true} is VALID [2022-04-15 06:09:35,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {39402#true} call ULTIMATE.init(); {39469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:09:35,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {39469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39402#true} is VALID [2022-04-15 06:09:35,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {39402#true} assume true; {39402#true} is VALID [2022-04-15 06:09:35,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39402#true} {39402#true} #34#return; {39402#true} is VALID [2022-04-15 06:09:35,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {39402#true} call #t~ret4 := main(); {39402#true} is VALID [2022-04-15 06:09:35,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {39402#true} ~x~0 := 0; {39407#(= main_~x~0 0)} is VALID [2022-04-15 06:09:35,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {39407#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39408#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:09:35,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {39408#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39409#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:09:35,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {39409#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39410#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:09:35,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {39410#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39411#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:09:35,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {39411#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39412#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:09:35,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {39412#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39413#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:09:35,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {39413#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39414#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:09:35,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {39414#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39415#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:09:35,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {39415#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39416#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:09:35,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {39416#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39417#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:09:35,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {39417#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39418#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:09:35,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {39418#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39419#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:09:35,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {39419#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39420#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:09:35,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {39420#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39421#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:09:35,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {39421#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39422#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:09:35,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {39422#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39423#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:09:35,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {39423#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39424#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:09:35,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {39424#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39425#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:09:35,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {39425#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39426#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:09:35,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {39426#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39427#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:09:35,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {39427#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39428#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:09:35,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {39428#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39429#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:09:35,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {39429#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39430#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:09:35,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {39430#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39431#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:09:35,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {39431#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39432#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:09:35,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {39432#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39433#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:09:35,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {39433#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39434#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:09:35,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {39434#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39435#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:09:35,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {39435#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39436#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:09:35,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {39436#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39437#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:09:35,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {39437#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39438#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:09:35,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {39438#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39439#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:09:35,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {39439#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39440#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:09:35,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {39440#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39441#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:09:35,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {39441#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39442#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:09:35,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {39442#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39443#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:09:35,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {39443#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39444#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:09:35,546 INFO L290 TraceCheckUtils]: 43: Hoare triple {39444#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39445#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:09:35,546 INFO L290 TraceCheckUtils]: 44: Hoare triple {39445#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39446#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:09:35,547 INFO L290 TraceCheckUtils]: 45: Hoare triple {39446#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39447#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:09:35,547 INFO L290 TraceCheckUtils]: 46: Hoare triple {39447#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39448#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:09:35,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {39448#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39449#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:09:35,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {39449#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39450#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:09:35,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {39450#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39451#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:09:35,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {39451#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39452#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:09:35,550 INFO L290 TraceCheckUtils]: 51: Hoare triple {39452#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39453#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:09:35,550 INFO L290 TraceCheckUtils]: 52: Hoare triple {39453#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39454#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:09:35,551 INFO L290 TraceCheckUtils]: 53: Hoare triple {39454#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39455#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:09:35,551 INFO L290 TraceCheckUtils]: 54: Hoare triple {39455#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39456#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:09:35,552 INFO L290 TraceCheckUtils]: 55: Hoare triple {39456#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39457#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:09:35,552 INFO L290 TraceCheckUtils]: 56: Hoare triple {39457#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39458#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:09:35,553 INFO L290 TraceCheckUtils]: 57: Hoare triple {39458#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39459#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:09:35,553 INFO L290 TraceCheckUtils]: 58: Hoare triple {39459#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39460#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:09:35,554 INFO L290 TraceCheckUtils]: 59: Hoare triple {39460#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39461#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:09:35,554 INFO L290 TraceCheckUtils]: 60: Hoare triple {39461#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39462#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:09:35,554 INFO L290 TraceCheckUtils]: 61: Hoare triple {39462#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39463#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:09:35,555 INFO L290 TraceCheckUtils]: 62: Hoare triple {39463#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39464#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:09:35,555 INFO L290 TraceCheckUtils]: 63: Hoare triple {39464#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39465#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:09:35,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {39465#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39466#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:09:35,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {39466#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39467#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:09:35,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {39467#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39468#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 122))} is VALID [2022-04-15 06:09:35,557 INFO L290 TraceCheckUtils]: 67: Hoare triple {39468#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 122))} assume !(~x~0 % 4294967296 < 268435455); {39403#false} is VALID [2022-04-15 06:09:35,558 INFO L272 TraceCheckUtils]: 68: Hoare triple {39403#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {39403#false} is VALID [2022-04-15 06:09:35,558 INFO L290 TraceCheckUtils]: 69: Hoare triple {39403#false} ~cond := #in~cond; {39403#false} is VALID [2022-04-15 06:09:35,558 INFO L290 TraceCheckUtils]: 70: Hoare triple {39403#false} assume 0 == ~cond; {39403#false} is VALID [2022-04-15 06:09:35,558 INFO L290 TraceCheckUtils]: 71: Hoare triple {39403#false} assume !false; {39403#false} is VALID [2022-04-15 06:09:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:09:35,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:09:35,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407812727] [2022-04-15 06:09:35,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407812727] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:09:35,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75181338] [2022-04-15 06:09:35,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:09:35,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:09:35,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:09:35,559 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:09:35,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-04-15 06:09:35,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:09:35,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:09:35,636 WARN L261 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 125 conjunts are in the unsatisfiable core [2022-04-15 06:09:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:35,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:09:36,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {39402#true} call ULTIMATE.init(); {39402#true} is VALID [2022-04-15 06:09:36,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {39402#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39402#true} is VALID [2022-04-15 06:09:36,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {39402#true} assume true; {39402#true} is VALID [2022-04-15 06:09:36,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39402#true} {39402#true} #34#return; {39402#true} is VALID [2022-04-15 06:09:36,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {39402#true} call #t~ret4 := main(); {39402#true} is VALID [2022-04-15 06:09:36,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {39402#true} ~x~0 := 0; {39407#(= main_~x~0 0)} is VALID [2022-04-15 06:09:36,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {39407#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39408#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:09:36,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {39408#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39409#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:09:36,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {39409#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39410#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:09:36,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {39410#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39411#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:09:36,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {39411#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39412#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:09:36,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {39412#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39413#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:09:36,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {39413#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39414#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:09:36,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {39414#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39415#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:09:36,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {39415#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39416#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:09:36,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {39416#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39417#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:09:36,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {39417#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39418#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:09:36,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {39418#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39419#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:09:36,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {39419#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39420#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:09:36,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {39420#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39421#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:09:36,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {39421#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39422#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:09:36,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {39422#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39423#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:09:36,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {39423#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39424#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:09:36,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {39424#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39425#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:09:36,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {39425#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39426#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:09:36,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {39426#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39427#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:09:36,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {39427#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39428#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:09:36,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {39428#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39429#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:09:36,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {39429#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39430#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:09:36,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {39430#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39431#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:09:36,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {39431#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39432#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:09:36,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {39432#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39433#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:09:36,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {39433#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39434#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:09:36,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {39434#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39435#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:09:36,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {39435#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39436#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:09:36,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {39436#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39437#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:09:36,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {39437#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39438#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:09:36,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {39438#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39439#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:09:36,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {39439#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39440#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:09:36,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {39440#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39441#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:09:36,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {39441#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39442#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:09:36,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {39442#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39443#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:09:36,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {39443#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39444#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:09:36,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {39444#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39445#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:09:36,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {39445#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39446#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:09:36,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {39446#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39447#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:09:36,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {39447#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39448#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:09:36,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {39448#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39449#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:09:36,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {39449#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39450#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:09:36,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {39450#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39451#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:09:36,378 INFO L290 TraceCheckUtils]: 50: Hoare triple {39451#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39452#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:09:36,378 INFO L290 TraceCheckUtils]: 51: Hoare triple {39452#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39453#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:09:36,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {39453#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39454#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:09:36,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {39454#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39455#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:09:36,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {39455#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39456#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:09:36,380 INFO L290 TraceCheckUtils]: 55: Hoare triple {39456#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39457#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:09:36,381 INFO L290 TraceCheckUtils]: 56: Hoare triple {39457#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39458#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:09:36,381 INFO L290 TraceCheckUtils]: 57: Hoare triple {39458#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39459#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:09:36,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {39459#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39460#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:09:36,382 INFO L290 TraceCheckUtils]: 59: Hoare triple {39460#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39461#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:09:36,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {39461#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39462#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:09:36,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {39462#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39463#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:09:36,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {39463#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39464#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:09:36,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {39464#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39465#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:09:36,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {39465#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39466#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:09:36,385 INFO L290 TraceCheckUtils]: 65: Hoare triple {39466#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39467#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:09:36,385 INFO L290 TraceCheckUtils]: 66: Hoare triple {39467#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39671#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-15 06:09:36,386 INFO L290 TraceCheckUtils]: 67: Hoare triple {39671#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !(~x~0 % 4294967296 < 268435455); {39403#false} is VALID [2022-04-15 06:09:36,386 INFO L272 TraceCheckUtils]: 68: Hoare triple {39403#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {39403#false} is VALID [2022-04-15 06:09:36,386 INFO L290 TraceCheckUtils]: 69: Hoare triple {39403#false} ~cond := #in~cond; {39403#false} is VALID [2022-04-15 06:09:36,386 INFO L290 TraceCheckUtils]: 70: Hoare triple {39403#false} assume 0 == ~cond; {39403#false} is VALID [2022-04-15 06:09:36,386 INFO L290 TraceCheckUtils]: 71: Hoare triple {39403#false} assume !false; {39403#false} is VALID [2022-04-15 06:09:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:09:36,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:09:42,229 INFO L290 TraceCheckUtils]: 71: Hoare triple {39403#false} assume !false; {39403#false} is VALID [2022-04-15 06:09:42,230 INFO L290 TraceCheckUtils]: 70: Hoare triple {39403#false} assume 0 == ~cond; {39403#false} is VALID [2022-04-15 06:09:42,230 INFO L290 TraceCheckUtils]: 69: Hoare triple {39403#false} ~cond := #in~cond; {39403#false} is VALID [2022-04-15 06:09:42,230 INFO L272 TraceCheckUtils]: 68: Hoare triple {39403#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {39403#false} is VALID [2022-04-15 06:09:42,230 INFO L290 TraceCheckUtils]: 67: Hoare triple {39699#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {39403#false} is VALID [2022-04-15 06:09:42,231 INFO L290 TraceCheckUtils]: 66: Hoare triple {39703#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39699#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {39707#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39703#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {39711#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39707#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {39715#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39711#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {39719#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39715#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,234 INFO L290 TraceCheckUtils]: 61: Hoare triple {39723#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39719#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {39727#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39723#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {39731#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39727#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {39735#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39731#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {39739#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39735#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,237 INFO L290 TraceCheckUtils]: 56: Hoare triple {39743#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39739#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,237 INFO L290 TraceCheckUtils]: 55: Hoare triple {39747#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39743#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {39751#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39747#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {39755#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39751#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {39759#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39755#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,240 INFO L290 TraceCheckUtils]: 51: Hoare triple {39763#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39759#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,240 INFO L290 TraceCheckUtils]: 50: Hoare triple {39767#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39763#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {39771#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39767#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {39775#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39771#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {39779#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39775#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {39783#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39779#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {39787#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39783#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {39791#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39787#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {39795#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39791#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {39799#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39795#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {39803#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39799#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {39807#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39803#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {39811#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39807#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {39815#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39811#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {39819#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39815#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {39823#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39819#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {39827#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39823#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {39831#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39827#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {39835#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39831#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {39839#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39835#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {39843#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39839#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {39847#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39843#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {39851#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39847#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {39855#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39851#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {39859#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39855#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {39863#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39859#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {39867#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39863#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {39871#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39867#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {39875#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39871#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {39879#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39875#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {39883#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39879#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {39887#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39883#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {39891#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39887#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {39895#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39891#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {39899#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39895#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {39903#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39899#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {39907#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39903#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {39911#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39907#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {39915#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39911#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {39919#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39915#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {39923#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39919#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {39927#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39923#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {39931#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39927#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {39935#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39931#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {39939#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39935#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {39943#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39939#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {39402#true} ~x~0 := 0; {39943#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} is VALID [2022-04-15 06:09:42,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {39402#true} call #t~ret4 := main(); {39402#true} is VALID [2022-04-15 06:09:42,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39402#true} {39402#true} #34#return; {39402#true} is VALID [2022-04-15 06:09:42,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {39402#true} assume true; {39402#true} is VALID [2022-04-15 06:09:42,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {39402#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39402#true} is VALID [2022-04-15 06:09:42,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {39402#true} call ULTIMATE.init(); {39402#true} is VALID [2022-04-15 06:09:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:09:42,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75181338] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:09:42,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:09:42,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 128 [2022-04-15 06:09:42,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:42,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [466371814] [2022-04-15 06:09:42,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [466371814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:42,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:42,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-15 06:09:42,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523008215] [2022-04-15 06:09:42,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:42,271 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-15 06:09:42,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:42,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:42,309 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-15 06:09:42,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-15 06:09:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-15 06:09:42,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4221, Invalid=12035, Unknown=0, NotChecked=0, Total=16256 [2022-04-15 06:09:42,310 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:49,906 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-15 06:09:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 06:09:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-15 06:09:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:09:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2022-04-15 06:09:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2022-04-15 06:09:49,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 79 transitions. [2022-04-15 06:09:49,956 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-15 06:09:49,957 INFO L225 Difference]: With dead ends: 79 [2022-04-15 06:09:49,957 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 06:09:49,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=8435, Invalid=27475, Unknown=0, NotChecked=0, Total=35910 [2022-04-15 06:09:49,959 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 4024 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 4024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:09:49,959 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 253 Invalid, 4149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 4024 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 06:09:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 06:09:50,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-15 06:09:50,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:09:50,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:50,082 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:50,082 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:50,083 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-15 06:09:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-15 06:09:50,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:50,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:50,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 06:09:50,083 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-15 06:09:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:50,084 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-15 06:09:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-15 06:09:50,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:50,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:50,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:09:50,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:09:50,084 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-15 06:09:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2022-04-15 06:09:50,085 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2022-04-15 06:09:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:09:50,085 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2022-04-15 06:09:50,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:50,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 74 transitions. [2022-04-15 06:09:50,156 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-15 06:09:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-15 06:09:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 06:09:50,157 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:09:50,157 INFO L499 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:09:50,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Forceful destruction successful, exit code 0 [2022-04-15 06:09:50,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2022-04-15 06:09:50,557 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:09:50,557 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:09:50,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:09:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1182461796, now seen corresponding path program 123 times [2022-04-15 06:09:50,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:50,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128031555] [2022-04-15 06:09:50,726 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:09:50,727 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:09:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1738118199, now seen corresponding path program 1 times [2022-04-15 06:09:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:50,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533015271] [2022-04-15 06:09:50,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:50,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:50,733 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_62.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_62.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:09:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:09:50,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526956299] [2022-04-15 06:09:50,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:50,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:09:50,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:09:50,736 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:09:50,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-04-15 06:09:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:09:50,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:09:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:09:50,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:09:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1182461796, now seen corresponding path program 124 times [2022-04-15 06:09:50,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:50,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032443483] [2022-04-15 06:09:50,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:50,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:52,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:09:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:52,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {40610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40542#true} is VALID [2022-04-15 06:09:52,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {40542#true} assume true; {40542#true} is VALID [2022-04-15 06:09:52,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40542#true} {40542#true} #34#return; {40542#true} is VALID [2022-04-15 06:09:52,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {40542#true} call ULTIMATE.init(); {40610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:09:52,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {40610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40542#true} is VALID [2022-04-15 06:09:52,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {40542#true} assume true; {40542#true} is VALID [2022-04-15 06:09:52,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40542#true} {40542#true} #34#return; {40542#true} is VALID [2022-04-15 06:09:52,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {40542#true} call #t~ret4 := main(); {40542#true} is VALID [2022-04-15 06:09:52,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {40542#true} ~x~0 := 0; {40547#(= main_~x~0 0)} is VALID [2022-04-15 06:09:52,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {40547#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40548#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:09:52,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {40548#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:09:52,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {40549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40550#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:09:52,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {40550#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:09:52,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {40551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:09:52,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {40552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40553#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:09:52,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {40553#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40554#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:09:52,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {40554#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:09:52,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {40555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40556#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:09:52,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {40556#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40557#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:09:52,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {40557#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40558#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:09:52,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {40558#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40559#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:09:52,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {40559#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:09:52,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {40560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40561#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:09:52,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {40561#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40562#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:09:52,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {40562#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40563#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:09:52,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {40563#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40564#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:09:52,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {40564#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40565#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:09:52,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {40565#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40566#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:09:52,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {40566#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40567#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:09:52,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {40567#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40568#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:09:52,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {40568#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40569#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:09:52,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {40569#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40570#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:09:52,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {40570#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40571#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:09:52,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {40571#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40572#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:09:52,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {40572#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40573#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:09:52,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {40573#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40574#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:09:52,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {40574#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40575#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:09:52,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {40575#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40576#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:09:52,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {40576#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40577#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:09:52,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {40577#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40578#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:09:52,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {40578#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40579#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:09:52,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {40579#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40580#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:09:52,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {40580#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40581#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:09:52,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {40581#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40582#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:09:52,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {40582#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40583#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:09:52,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {40583#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40584#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:09:52,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {40584#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40585#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:09:52,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {40585#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40586#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:09:52,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {40586#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40587#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:09:52,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {40587#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40588#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:09:52,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {40588#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40589#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:09:52,692 INFO L290 TraceCheckUtils]: 48: Hoare triple {40589#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40590#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:09:52,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {40590#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40591#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:09:52,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {40591#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40592#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:09:52,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {40592#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40593#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:09:52,694 INFO L290 TraceCheckUtils]: 52: Hoare triple {40593#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40594#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:09:52,694 INFO L290 TraceCheckUtils]: 53: Hoare triple {40594#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40595#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:09:52,694 INFO L290 TraceCheckUtils]: 54: Hoare triple {40595#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40596#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:09:52,695 INFO L290 TraceCheckUtils]: 55: Hoare triple {40596#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40597#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:09:52,695 INFO L290 TraceCheckUtils]: 56: Hoare triple {40597#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40598#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:09:52,696 INFO L290 TraceCheckUtils]: 57: Hoare triple {40598#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40599#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:09:52,696 INFO L290 TraceCheckUtils]: 58: Hoare triple {40599#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40600#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:09:52,697 INFO L290 TraceCheckUtils]: 59: Hoare triple {40600#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40601#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:09:52,697 INFO L290 TraceCheckUtils]: 60: Hoare triple {40601#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40602#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:09:52,698 INFO L290 TraceCheckUtils]: 61: Hoare triple {40602#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40603#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:09:52,698 INFO L290 TraceCheckUtils]: 62: Hoare triple {40603#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40604#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:09:52,699 INFO L290 TraceCheckUtils]: 63: Hoare triple {40604#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40605#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:09:52,699 INFO L290 TraceCheckUtils]: 64: Hoare triple {40605#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40606#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:09:52,700 INFO L290 TraceCheckUtils]: 65: Hoare triple {40606#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40607#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:09:52,700 INFO L290 TraceCheckUtils]: 66: Hoare triple {40607#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40608#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-15 06:09:52,701 INFO L290 TraceCheckUtils]: 67: Hoare triple {40608#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40609#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 124))} is VALID [2022-04-15 06:09:52,701 INFO L290 TraceCheckUtils]: 68: Hoare triple {40609#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 124))} assume !(~x~0 % 4294967296 < 268435455); {40543#false} is VALID [2022-04-15 06:09:52,701 INFO L272 TraceCheckUtils]: 69: Hoare triple {40543#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {40543#false} is VALID [2022-04-15 06:09:52,701 INFO L290 TraceCheckUtils]: 70: Hoare triple {40543#false} ~cond := #in~cond; {40543#false} is VALID [2022-04-15 06:09:52,701 INFO L290 TraceCheckUtils]: 71: Hoare triple {40543#false} assume 0 == ~cond; {40543#false} is VALID [2022-04-15 06:09:52,701 INFO L290 TraceCheckUtils]: 72: Hoare triple {40543#false} assume !false; {40543#false} is VALID [2022-04-15 06:09:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:09:52,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:09:52,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032443483] [2022-04-15 06:09:52,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032443483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:09:52,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102628986] [2022-04-15 06:09:52,702 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:09:52,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:09:52,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:09:52,703 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:09:52,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-04-15 06:09:52,809 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:09:52,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:09:52,811 WARN L261 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 127 conjunts are in the unsatisfiable core [2022-04-15 06:09:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:52,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:09:53,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {40542#true} call ULTIMATE.init(); {40542#true} is VALID [2022-04-15 06:09:53,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {40542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40542#true} is VALID [2022-04-15 06:09:53,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {40542#true} assume true; {40542#true} is VALID [2022-04-15 06:09:53,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40542#true} {40542#true} #34#return; {40542#true} is VALID [2022-04-15 06:09:53,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {40542#true} call #t~ret4 := main(); {40542#true} is VALID [2022-04-15 06:09:53,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {40542#true} ~x~0 := 0; {40547#(= main_~x~0 0)} is VALID [2022-04-15 06:09:53,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {40547#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40548#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:09:53,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {40548#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:09:53,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {40549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40550#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:09:53,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {40550#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:09:53,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {40551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:09:53,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {40552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40553#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:09:53,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {40553#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40554#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:09:53,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {40554#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:09:53,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {40555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40556#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:09:53,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {40556#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40557#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:09:53,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {40557#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40558#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:09:53,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {40558#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40559#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:09:53,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {40559#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:09:53,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {40560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40561#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:09:53,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {40561#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40562#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:09:53,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {40562#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40563#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:09:53,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {40563#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40564#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:09:53,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {40564#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40565#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:09:53,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {40565#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40566#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:09:53,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {40566#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40567#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:09:53,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {40567#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40568#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:09:53,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {40568#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40569#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:09:53,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {40569#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40570#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:09:53,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {40570#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40571#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:09:53,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {40571#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40572#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:09:53,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {40572#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40573#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:09:53,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {40573#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40574#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:09:53,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {40574#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40575#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:09:53,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {40575#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40576#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:09:53,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {40576#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40577#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:09:53,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {40577#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40578#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:09:53,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {40578#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40579#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:09:53,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {40579#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40580#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:09:53,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {40580#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40581#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:09:53,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {40581#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40582#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:09:53,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {40582#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40583#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:09:53,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {40583#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40584#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:09:53,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {40584#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40585#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:09:53,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {40585#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40586#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:09:53,551 INFO L290 TraceCheckUtils]: 45: Hoare triple {40586#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40587#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:09:53,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {40587#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40588#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:09:53,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {40588#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40589#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:09:53,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {40589#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40590#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:09:53,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {40590#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40591#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:09:53,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {40591#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40592#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:09:53,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {40592#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40593#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:09:53,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {40593#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40594#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:09:53,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {40594#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40595#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:09:53,555 INFO L290 TraceCheckUtils]: 54: Hoare triple {40595#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40596#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:09:53,555 INFO L290 TraceCheckUtils]: 55: Hoare triple {40596#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40597#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:09:53,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {40597#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40598#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:09:53,556 INFO L290 TraceCheckUtils]: 57: Hoare triple {40598#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40599#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:09:53,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {40599#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40600#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:09:53,557 INFO L290 TraceCheckUtils]: 59: Hoare triple {40600#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40601#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:09:53,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {40601#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40602#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:09:53,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {40602#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40603#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:09:53,559 INFO L290 TraceCheckUtils]: 62: Hoare triple {40603#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40604#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:09:53,559 INFO L290 TraceCheckUtils]: 63: Hoare triple {40604#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40605#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:09:53,560 INFO L290 TraceCheckUtils]: 64: Hoare triple {40605#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40606#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:09:53,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {40606#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40607#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:09:53,561 INFO L290 TraceCheckUtils]: 66: Hoare triple {40607#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40608#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-15 06:09:53,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {40608#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40815#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-15 06:09:53,562 INFO L290 TraceCheckUtils]: 68: Hoare triple {40815#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !(~x~0 % 4294967296 < 268435455); {40543#false} is VALID [2022-04-15 06:09:53,562 INFO L272 TraceCheckUtils]: 69: Hoare triple {40543#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {40543#false} is VALID [2022-04-15 06:09:53,562 INFO L290 TraceCheckUtils]: 70: Hoare triple {40543#false} ~cond := #in~cond; {40543#false} is VALID [2022-04-15 06:09:53,562 INFO L290 TraceCheckUtils]: 71: Hoare triple {40543#false} assume 0 == ~cond; {40543#false} is VALID [2022-04-15 06:09:53,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {40543#false} assume !false; {40543#false} is VALID [2022-04-15 06:09:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:09:53,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:09:59,510 INFO L290 TraceCheckUtils]: 72: Hoare triple {40543#false} assume !false; {40543#false} is VALID [2022-04-15 06:09:59,510 INFO L290 TraceCheckUtils]: 71: Hoare triple {40543#false} assume 0 == ~cond; {40543#false} is VALID [2022-04-15 06:09:59,510 INFO L290 TraceCheckUtils]: 70: Hoare triple {40543#false} ~cond := #in~cond; {40543#false} is VALID [2022-04-15 06:09:59,510 INFO L272 TraceCheckUtils]: 69: Hoare triple {40543#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {40543#false} is VALID [2022-04-15 06:09:59,511 INFO L290 TraceCheckUtils]: 68: Hoare triple {40843#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {40543#false} is VALID [2022-04-15 06:09:59,511 INFO L290 TraceCheckUtils]: 67: Hoare triple {40847#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40843#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,512 INFO L290 TraceCheckUtils]: 66: Hoare triple {40851#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40847#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,513 INFO L290 TraceCheckUtils]: 65: Hoare triple {40855#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40851#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,513 INFO L290 TraceCheckUtils]: 64: Hoare triple {40859#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40855#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,514 INFO L290 TraceCheckUtils]: 63: Hoare triple {40863#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40859#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,514 INFO L290 TraceCheckUtils]: 62: Hoare triple {40867#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40863#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,515 INFO L290 TraceCheckUtils]: 61: Hoare triple {40871#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40867#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {40875#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40871#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {40879#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40875#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {40883#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40879#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {40887#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40883#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {40891#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40887#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {40895#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40891#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {40899#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40895#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {40903#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40899#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {40907#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40903#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,521 INFO L290 TraceCheckUtils]: 51: Hoare triple {40911#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40907#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {40915#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40911#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {40919#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40915#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {40923#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40919#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {40927#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40923#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,524 INFO L290 TraceCheckUtils]: 46: Hoare triple {40931#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40927#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {40935#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40931#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {40939#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40935#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {40943#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40939#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {40947#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40943#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {40951#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40947#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {40955#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40951#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {40959#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40955#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {40963#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40959#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {40967#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40963#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {40971#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40967#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {40975#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40971#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {40979#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40975#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {40983#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40979#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {40987#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40983#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {40991#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40987#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {40995#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40991#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {40999#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40995#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {41003#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40999#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {41007#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41003#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {41011#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41007#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {41015#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41011#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {41019#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41015#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {41023#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41019#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {41027#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41023#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {41031#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41027#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {41035#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41031#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {41039#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41035#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {41043#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41039#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {41047#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41043#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {41051#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41047#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {41055#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41051#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {41059#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41055#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {41063#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41059#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {41067#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41063#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {41071#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41067#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {41075#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41071#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {41079#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41075#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {41083#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41079#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {41087#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41083#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {41091#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41087#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {40542#true} ~x~0 := 0; {41091#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} is VALID [2022-04-15 06:09:59,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {40542#true} call #t~ret4 := main(); {40542#true} is VALID [2022-04-15 06:09:59,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40542#true} {40542#true} #34#return; {40542#true} is VALID [2022-04-15 06:09:59,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {40542#true} assume true; {40542#true} is VALID [2022-04-15 06:09:59,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {40542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40542#true} is VALID [2022-04-15 06:09:59,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {40542#true} call ULTIMATE.init(); {40542#true} is VALID [2022-04-15 06:09:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:09:59,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102628986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:09:59,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:09:59,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 130 [2022-04-15 06:09:59,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:59,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128031555] [2022-04-15 06:09:59,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128031555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:59,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:59,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 06:09:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909329794] [2022-04-15 06:09:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:59,552 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 06:09:59,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:59,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:09:59,605 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-15 06:09:59,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 06:09:59,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:59,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 06:09:59,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4352, Invalid=12418, Unknown=0, NotChecked=0, Total=16770 [2022-04-15 06:09:59,609 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:10:07,298 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-15 06:10:07,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-15 06:10:07,298 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 06:10:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:10:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-04-15 06:10:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-04-15 06:10:07,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 80 transitions. [2022-04-15 06:10:07,349 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-15 06:10:07,350 INFO L225 Difference]: With dead ends: 80 [2022-04-15 06:10:07,350 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 06:10:07,352 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=8697, Invalid=28359, Unknown=0, NotChecked=0, Total=37056 [2022-04-15 06:10:07,352 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4028 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 4155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 4028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:10:07,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 4155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 4028 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 06:10:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 06:10:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 06:10:07,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:10:07,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:07,451 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:07,451 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:10:07,452 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-15 06:10:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-15 06:10:07,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:10:07,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:10:07,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 06:10:07,452 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 06:10:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:10:07,453 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-15 06:10:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-15 06:10:07,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:10:07,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:10:07,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:10:07,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:10:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2022-04-15 06:10:07,454 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2022-04-15 06:10:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:10:07,454 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2022-04-15 06:10:07,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:07,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 75 transitions. [2022-04-15 06:10:07,510 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-15 06:10:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-15 06:10:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 06:10:07,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:10:07,510 INFO L499 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:10:07,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2022-04-15 06:10:07,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2022-04-15 06:10:07,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125 [2022-04-15 06:10:07,911 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:10:07,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:10:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2034851254, now seen corresponding path program 125 times [2022-04-15 06:10:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:10:07,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [687438880] [2022-04-15 06:10:08,089 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:10:08,091 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:10:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1797223543, now seen corresponding path program 1 times [2022-04-15 06:10:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:10:08,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129731805] [2022-04-15 06:10:08,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:10:08,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:10:08,096 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_63.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_63.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:10:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:10:08,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430282662] [2022-04-15 06:10:08,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:10:08,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:10:08,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:10:08,101 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:10:08,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-04-15 06:10:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:10:08,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:10:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:10:08,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:10:08,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2034851254, now seen corresponding path program 126 times [2022-04-15 06:10:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:10:08,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949142027] [2022-04-15 06:10:08,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:10:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:10:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:10:10,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:10:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:10:10,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {41767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41698#true} is VALID [2022-04-15 06:10:10,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {41698#true} assume true; {41698#true} is VALID [2022-04-15 06:10:10,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41698#true} {41698#true} #34#return; {41698#true} is VALID [2022-04-15 06:10:10,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {41698#true} call ULTIMATE.init(); {41767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:10:10,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {41767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41698#true} is VALID [2022-04-15 06:10:10,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {41698#true} assume true; {41698#true} is VALID [2022-04-15 06:10:10,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41698#true} {41698#true} #34#return; {41698#true} is VALID [2022-04-15 06:10:10,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {41698#true} call #t~ret4 := main(); {41698#true} is VALID [2022-04-15 06:10:10,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {41698#true} ~x~0 := 0; {41703#(= main_~x~0 0)} is VALID [2022-04-15 06:10:10,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {41703#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41704#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:10:10,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {41704#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41705#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:10:10,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {41705#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41706#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:10:10,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {41706#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41707#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:10:10,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {41707#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41708#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:10:10,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {41708#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:10:10,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {41709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41710#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:10:10,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {41710#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:10:10,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {41711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41712#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:10:10,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {41712#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41713#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:10:10,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {41713#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41714#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:10:10,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {41714#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41715#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:10:10,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {41715#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41716#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:10:10,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {41716#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41717#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:10:10,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {41717#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41718#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:10:10,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {41718#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41719#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:10:10,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {41719#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41720#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:10:10,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {41720#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41721#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:10:10,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {41721#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41722#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:10:10,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {41722#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41723#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:10:10,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {41723#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41724#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:10:10,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {41724#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41725#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:10:10,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {41725#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41726#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:10:10,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {41726#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41727#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:10:10,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {41727#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41728#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:10:10,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {41728#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41729#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:10:10,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {41729#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41730#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:10:10,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {41730#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41731#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:10:10,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {41731#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41732#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:10:10,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {41732#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41733#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:10:10,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {41733#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41734#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:10:10,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {41734#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41735#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:10:10,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {41735#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41736#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:10:10,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {41736#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41737#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:10:10,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {41737#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41738#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:10:10,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {41738#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41739#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:10:10,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {41739#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41740#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:10:10,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {41740#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41741#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:10:10,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {41741#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41742#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:10:10,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {41742#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41743#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:10:10,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {41743#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41744#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:10:10,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {41744#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41745#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:10:10,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {41745#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41746#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:10:10,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {41746#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41747#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:10:10,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {41747#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41748#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:10:10,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {41748#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41749#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:10:10,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {41749#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41750#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:10:10,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {41750#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41751#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:10:10,135 INFO L290 TraceCheckUtils]: 54: Hoare triple {41751#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41752#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:10:10,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {41752#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41753#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:10:10,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {41753#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41754#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:10:10,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {41754#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41755#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:10:10,137 INFO L290 TraceCheckUtils]: 58: Hoare triple {41755#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41756#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:10:10,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {41756#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41757#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:10:10,138 INFO L290 TraceCheckUtils]: 60: Hoare triple {41757#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41758#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:10:10,138 INFO L290 TraceCheckUtils]: 61: Hoare triple {41758#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41759#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:10:10,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {41759#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41760#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:10:10,139 INFO L290 TraceCheckUtils]: 63: Hoare triple {41760#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41761#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:10:10,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {41761#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41762#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:10:10,140 INFO L290 TraceCheckUtils]: 65: Hoare triple {41762#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41763#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:10:10,141 INFO L290 TraceCheckUtils]: 66: Hoare triple {41763#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41764#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-15 06:10:10,141 INFO L290 TraceCheckUtils]: 67: Hoare triple {41764#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41765#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-15 06:10:10,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {41765#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41766#(and (<= main_~x~0 126) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:10:10,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {41766#(and (<= main_~x~0 126) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {41699#false} is VALID [2022-04-15 06:10:10,142 INFO L272 TraceCheckUtils]: 70: Hoare triple {41699#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {41699#false} is VALID [2022-04-15 06:10:10,142 INFO L290 TraceCheckUtils]: 71: Hoare triple {41699#false} ~cond := #in~cond; {41699#false} is VALID [2022-04-15 06:10:10,142 INFO L290 TraceCheckUtils]: 72: Hoare triple {41699#false} assume 0 == ~cond; {41699#false} is VALID [2022-04-15 06:10:10,142 INFO L290 TraceCheckUtils]: 73: Hoare triple {41699#false} assume !false; {41699#false} is VALID [2022-04-15 06:10:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:10:10,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:10:10,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949142027] [2022-04-15 06:10:10,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949142027] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:10:10,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62861724] [2022-04-15 06:10:10,143 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:10:10,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:10:10,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:10:10,144 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:10:10,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-04-15 06:10:34,573 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2022-04-15 06:10:34,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:10:34,586 WARN L261 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 135 conjunts are in the unsatisfiable core [2022-04-15 06:10:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:10:34,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:10:35,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {41698#true} call ULTIMATE.init(); {41698#true} is VALID [2022-04-15 06:10:35,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {41698#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41698#true} is VALID [2022-04-15 06:10:35,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {41698#true} assume true; {41698#true} is VALID [2022-04-15 06:10:35,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41698#true} {41698#true} #34#return; {41698#true} is VALID [2022-04-15 06:10:35,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {41698#true} call #t~ret4 := main(); {41698#true} is VALID [2022-04-15 06:10:35,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {41698#true} ~x~0 := 0; {41703#(= main_~x~0 0)} is VALID [2022-04-15 06:10:35,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {41703#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41704#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:10:35,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {41704#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41705#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:10:35,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {41705#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41706#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:10:35,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {41706#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41707#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:10:35,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {41707#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41708#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:10:35,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {41708#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:10:35,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {41709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41710#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:10:35,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {41710#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:10:35,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {41711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41712#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:10:35,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {41712#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41713#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:10:35,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {41713#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41714#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:10:35,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {41714#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41715#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:10:35,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {41715#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41716#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:10:35,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {41716#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41717#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:10:35,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {41717#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41718#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:10:35,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {41718#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41719#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:10:35,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {41719#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41720#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:10:35,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {41720#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41721#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:10:35,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {41721#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41722#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:10:35,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {41722#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41723#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:10:35,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {41723#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41724#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:10:35,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {41724#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41725#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:10:35,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {41725#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41726#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:10:35,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {41726#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41727#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:10:35,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {41727#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41728#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:10:35,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {41728#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41729#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:10:35,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {41729#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41730#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:10:35,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {41730#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41731#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:10:35,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {41731#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41732#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:10:35,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {41732#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41733#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:10:35,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {41733#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41734#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:10:35,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {41734#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41735#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:10:35,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {41735#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41736#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:10:35,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {41736#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41737#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:10:35,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {41737#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41738#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:10:35,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {41738#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41739#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:10:35,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {41739#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41740#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:10:35,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {41740#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41741#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:10:35,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {41741#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41742#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:10:35,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {41742#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41743#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:10:35,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {41743#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41744#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:10:35,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {41744#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41745#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:10:35,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {41745#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41746#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:10:35,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {41746#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41747#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:10:35,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {41747#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41748#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:10:35,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {41748#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41749#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:10:35,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {41749#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41750#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:10:35,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {41750#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41751#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:10:35,258 INFO L290 TraceCheckUtils]: 54: Hoare triple {41751#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41752#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:10:35,259 INFO L290 TraceCheckUtils]: 55: Hoare triple {41752#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41753#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:10:35,259 INFO L290 TraceCheckUtils]: 56: Hoare triple {41753#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41754#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:10:35,260 INFO L290 TraceCheckUtils]: 57: Hoare triple {41754#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41755#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:10:35,260 INFO L290 TraceCheckUtils]: 58: Hoare triple {41755#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41756#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:10:35,261 INFO L290 TraceCheckUtils]: 59: Hoare triple {41756#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41757#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:10:35,261 INFO L290 TraceCheckUtils]: 60: Hoare triple {41757#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41758#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:10:35,262 INFO L290 TraceCheckUtils]: 61: Hoare triple {41758#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41759#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:10:35,262 INFO L290 TraceCheckUtils]: 62: Hoare triple {41759#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41760#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:10:35,263 INFO L290 TraceCheckUtils]: 63: Hoare triple {41760#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41761#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:10:35,263 INFO L290 TraceCheckUtils]: 64: Hoare triple {41761#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41762#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:10:35,263 INFO L290 TraceCheckUtils]: 65: Hoare triple {41762#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41763#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:10:35,264 INFO L290 TraceCheckUtils]: 66: Hoare triple {41763#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41764#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-15 06:10:35,264 INFO L290 TraceCheckUtils]: 67: Hoare triple {41764#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41765#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-15 06:10:35,265 INFO L290 TraceCheckUtils]: 68: Hoare triple {41765#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41975#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-15 06:10:35,265 INFO L290 TraceCheckUtils]: 69: Hoare triple {41975#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !(~x~0 % 4294967296 < 268435455); {41699#false} is VALID [2022-04-15 06:10:35,265 INFO L272 TraceCheckUtils]: 70: Hoare triple {41699#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {41699#false} is VALID [2022-04-15 06:10:35,266 INFO L290 TraceCheckUtils]: 71: Hoare triple {41699#false} ~cond := #in~cond; {41699#false} is VALID [2022-04-15 06:10:35,266 INFO L290 TraceCheckUtils]: 72: Hoare triple {41699#false} assume 0 == ~cond; {41699#false} is VALID [2022-04-15 06:10:35,266 INFO L290 TraceCheckUtils]: 73: Hoare triple {41699#false} assume !false; {41699#false} is VALID [2022-04-15 06:10:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:10:35,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:10:43,834 INFO L290 TraceCheckUtils]: 73: Hoare triple {41699#false} assume !false; {41699#false} is VALID [2022-04-15 06:10:43,834 INFO L290 TraceCheckUtils]: 72: Hoare triple {41994#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {41699#false} is VALID [2022-04-15 06:10:43,835 INFO L290 TraceCheckUtils]: 71: Hoare triple {41998#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {41994#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:10:43,835 INFO L272 TraceCheckUtils]: 70: Hoare triple {42002#(not (= (mod main_~x~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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {41998#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:10:43,835 INFO L290 TraceCheckUtils]: 69: Hoare triple {42006#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {42002#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:10:43,836 INFO L290 TraceCheckUtils]: 68: Hoare triple {42010#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42006#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {42014#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42010#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,838 INFO L290 TraceCheckUtils]: 66: Hoare triple {42018#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42014#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {42022#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42018#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {42026#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42022#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,840 INFO L290 TraceCheckUtils]: 63: Hoare triple {42030#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42026#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {42034#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42030#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {42038#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42034#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {42042#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42038#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,848 INFO L290 TraceCheckUtils]: 59: Hoare triple {42046#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42042#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,848 INFO L290 TraceCheckUtils]: 58: Hoare triple {42050#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42046#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {42054#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42050#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {42058#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42054#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,853 INFO L290 TraceCheckUtils]: 55: Hoare triple {42062#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42058#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,854 INFO L290 TraceCheckUtils]: 54: Hoare triple {42066#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42062#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,857 INFO L290 TraceCheckUtils]: 53: Hoare triple {42070#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42066#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {42074#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42070#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,859 INFO L290 TraceCheckUtils]: 51: Hoare triple {42078#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42074#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {42082#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42078#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {42086#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42082#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,861 INFO L290 TraceCheckUtils]: 48: Hoare triple {42090#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42086#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {42094#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42090#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {42098#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42094#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {42102#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42098#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {42106#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42102#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {42110#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42106#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {42114#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42110#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {42118#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42114#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {42122#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42118#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {42126#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42122#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {42130#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42126#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {42134#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42130#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {42138#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42134#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {42142#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42138#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {42146#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42142#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {42150#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42146#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {42154#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42150#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {42158#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42154#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {42162#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42158#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {42166#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42162#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {42170#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42166#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {42174#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42170#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {42178#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42174#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {42182#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42178#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {42186#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42182#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {42190#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42186#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {42194#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42190#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {42198#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42194#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {42202#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42198#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {42206#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42202#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {42210#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42206#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {42214#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42210#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {42218#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42214#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {42222#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42218#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {42226#(or (< (mod (+ 110 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42222#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {42230#(or (< (mod (+ 112 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42226#(or (< (mod (+ 110 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {42234#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 114) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42230#(or (< (mod (+ 112 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {42238#(or (< (mod (+ 116 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42234#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 114) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {42242#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 118) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42238#(or (< (mod (+ 116 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {42246#(or (< (mod (+ main_~x~0 120) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42242#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 118) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {42250#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 122) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42246#(or (< (mod (+ main_~x~0 120) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {42254#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 124) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42250#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 122) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {42258#(or (< (mod (+ main_~x~0 126) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42254#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 124) 4294967296) 268435455))} is VALID [2022-04-15 06:10:43,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {41698#true} ~x~0 := 0; {42258#(or (< (mod (+ main_~x~0 126) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 06:10:43,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {41698#true} call #t~ret4 := main(); {41698#true} is VALID [2022-04-15 06:10:43,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41698#true} {41698#true} #34#return; {41698#true} is VALID [2022-04-15 06:10:43,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {41698#true} assume true; {41698#true} is VALID [2022-04-15 06:10:43,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {41698#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41698#true} is VALID [2022-04-15 06:10:43,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {41698#true} call ULTIMATE.init(); {41698#true} is VALID [2022-04-15 06:10:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:10:43,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62861724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:10:43,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:10:43,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 69] total 135 [2022-04-15 06:10:43,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:10:43,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [687438880] [2022-04-15 06:10:43,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [687438880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:10:43,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:10:43,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-15 06:10:43,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072188834] [2022-04-15 06:10:43,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:10:43,971 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 06:10:43,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:10:43,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:44,010 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-15 06:10:44,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-15 06:10:44,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:10:44,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-15 06:10:44,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4555, Invalid=13535, Unknown=0, NotChecked=0, Total=18090 [2022-04-15 06:10:44,011 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:10:52,112 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2022-04-15 06:10:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-15 06:10:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 06:10:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:10:52,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-04-15 06:10:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-04-15 06:10:52,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 81 transitions. [2022-04-15 06:10:52,163 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-15 06:10:52,164 INFO L225 Difference]: With dead ends: 81 [2022-04-15 06:10:52,164 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 06:10:52,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=9033, Invalid=30369, Unknown=0, NotChecked=0, Total=39402 [2022-04-15 06:10:52,166 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 4274 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 4274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:10:52,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 253 Invalid, 4403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 4274 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 06:10:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 06:10:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-15 06:10:52,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:10:52,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:52,252 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:52,252 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:52,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:10:52,253 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-15 06:10:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-15 06:10:52,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:10:52,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:10:52,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 06:10:52,253 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 06:10:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:10:52,254 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-15 06:10:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-15 06:10:52,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:10:52,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:10:52,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:10:52,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:10:52,254 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-15 06:10:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2022-04-15 06:10:52,255 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2022-04-15 06:10:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:10:52,255 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2022-04-15 06:10:52,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:10:52,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 76 transitions. [2022-04-15 06:10:52,311 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-15 06:10:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-15 06:10:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 06:10:52,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:10:52,312 INFO L499 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:10:52,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Forceful destruction successful, exit code 0 [2022-04-15 06:10:52,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Ended with exit code 0 [2022-04-15 06:10:52,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126,SelfDestructingSolverStorable127,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:10:52,713 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:10:52,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:10:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1307659300, now seen corresponding path program 127 times [2022-04-15 06:10:52,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:10:52,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1597526629] [2022-04-15 06:10:54,895 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:10:54,896 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:10:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1856328887, now seen corresponding path program 1 times [2022-04-15 06:10:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:10:54,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97306111] [2022-04-15 06:10:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:10:54,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:10:54,909 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_64.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_64.0)) 4294967296)) 268435455) 0)) [2022-04-15 06:10:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:10:54,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142931609] [2022-04-15 06:10:54,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:10:54,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:10:54,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:10:54,916 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:10:54,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-04-15 06:10:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:10:54,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:10:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:10:54,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:10:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1307659300, now seen corresponding path program 128 times [2022-04-15 06:10:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:10:54,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222549846] [2022-04-15 06:10:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:10:54,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:10:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:10:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:10:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:10:57,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {42943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {42873#true} is VALID [2022-04-15 06:10:57,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {42873#true} assume true; {42873#true} is VALID [2022-04-15 06:10:57,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42873#true} {42873#true} #34#return; {42873#true} is VALID [2022-04-15 06:10:57,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {42873#true} call ULTIMATE.init(); {42943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:10:57,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {42943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {42873#true} is VALID [2022-04-15 06:10:57,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {42873#true} assume true; {42873#true} is VALID [2022-04-15 06:10:57,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42873#true} {42873#true} #34#return; {42873#true} is VALID [2022-04-15 06:10:57,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {42873#true} call #t~ret4 := main(); {42873#true} is VALID [2022-04-15 06:10:57,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {42873#true} ~x~0 := 0; {42878#(= main_~x~0 0)} is VALID [2022-04-15 06:10:57,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {42878#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:10:57,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {42879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:10:57,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {42880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:10:57,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {42881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:10:57,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {42882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:10:57,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {42883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:10:57,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {42884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:10:57,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {42885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:10:57,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {42886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:10:57,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {42887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:10:57,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {42888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:10:57,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {42889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:10:57,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {42890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:10:57,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {42891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:10:57,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {42892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:10:57,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {42893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:10:57,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {42894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:10:57,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {42895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:10:57,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {42896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:10:57,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {42897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:10:57,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {42898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:10:57,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {42899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:10:57,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {42900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:10:57,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {42901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:10:57,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {42902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:10:57,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {42903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:10:57,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {42904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:10:57,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {42905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:10:57,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {42906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:10:57,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {42907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:10:57,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {42908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:10:57,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {42909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:10:57,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {42910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:10:57,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {42911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:10:57,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {42912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:10:57,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {42913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:10:57,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {42914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:10:57,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {42915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:10:57,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {42916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:10:57,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {42917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:10:57,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {42918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:10:57,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {42919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:10:57,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {42920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:10:57,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {42921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:10:57,042 INFO L290 TraceCheckUtils]: 50: Hoare triple {42922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:10:57,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {42923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:10:57,043 INFO L290 TraceCheckUtils]: 52: Hoare triple {42924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:10:57,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {42925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:10:57,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {42926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:10:57,045 INFO L290 TraceCheckUtils]: 55: Hoare triple {42927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:10:57,045 INFO L290 TraceCheckUtils]: 56: Hoare triple {42928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42929#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:10:57,046 INFO L290 TraceCheckUtils]: 57: Hoare triple {42929#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42930#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:10:57,046 INFO L290 TraceCheckUtils]: 58: Hoare triple {42930#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42931#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:10:57,047 INFO L290 TraceCheckUtils]: 59: Hoare triple {42931#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42932#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:10:57,047 INFO L290 TraceCheckUtils]: 60: Hoare triple {42932#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42933#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:10:57,048 INFO L290 TraceCheckUtils]: 61: Hoare triple {42933#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42934#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:10:57,048 INFO L290 TraceCheckUtils]: 62: Hoare triple {42934#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42935#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:10:57,049 INFO L290 TraceCheckUtils]: 63: Hoare triple {42935#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42936#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:10:57,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {42936#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42937#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:10:57,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {42937#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42938#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:10:57,050 INFO L290 TraceCheckUtils]: 66: Hoare triple {42938#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42939#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-15 06:10:57,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {42939#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42940#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-15 06:10:57,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {42940#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42941#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-15 06:10:57,052 INFO L290 TraceCheckUtils]: 69: Hoare triple {42941#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42942#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 128))} is VALID [2022-04-15 06:10:57,052 INFO L290 TraceCheckUtils]: 70: Hoare triple {42942#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 128))} assume !(~x~0 % 4294967296 < 268435455); {42874#false} is VALID [2022-04-15 06:10:57,052 INFO L272 TraceCheckUtils]: 71: Hoare triple {42874#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {42874#false} is VALID [2022-04-15 06:10:57,052 INFO L290 TraceCheckUtils]: 72: Hoare triple {42874#false} ~cond := #in~cond; {42874#false} is VALID [2022-04-15 06:10:57,052 INFO L290 TraceCheckUtils]: 73: Hoare triple {42874#false} assume 0 == ~cond; {42874#false} is VALID [2022-04-15 06:10:57,052 INFO L290 TraceCheckUtils]: 74: Hoare triple {42874#false} assume !false; {42874#false} is VALID [2022-04-15 06:10:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:10:57,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:10:57,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222549846] [2022-04-15 06:10:57,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222549846] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:10:57,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138579433] [2022-04-15 06:10:57,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:10:57,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:10:57,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:10:57,055 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:10:57,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-04-15 06:10:57,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:10:57,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:10:57,211 WARN L261 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 131 conjunts are in the unsatisfiable core [2022-04-15 06:10:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:10:57,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:10:57,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {42873#true} call ULTIMATE.init(); {42873#true} is VALID [2022-04-15 06:10:57,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {42873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {42873#true} is VALID [2022-04-15 06:10:57,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {42873#true} assume true; {42873#true} is VALID [2022-04-15 06:10:57,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42873#true} {42873#true} #34#return; {42873#true} is VALID [2022-04-15 06:10:57,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {42873#true} call #t~ret4 := main(); {42873#true} is VALID [2022-04-15 06:10:57,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {42873#true} ~x~0 := 0; {42878#(= main_~x~0 0)} is VALID [2022-04-15 06:10:57,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {42878#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:10:57,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {42879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:10:57,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {42880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:10:57,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {42881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:10:57,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {42882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:10:57,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {42883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:10:57,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {42884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:10:57,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {42885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:10:57,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {42886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:10:57,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {42887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:10:57,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {42888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:10:57,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {42889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:10:57,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {42890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:10:57,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {42891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:10:57,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {42892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:10:57,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {42893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:10:57,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {42894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:10:57,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {42895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:10:57,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {42896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:10:57,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {42897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:10:57,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {42898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:10:57,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {42899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:10:57,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {42900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:10:57,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {42901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:10:57,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {42902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:10:57,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {42903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:10:57,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {42904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:10:57,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {42905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:10:57,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {42906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:10:57,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {42907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:10:57,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {42908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:10:57,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {42909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:10:57,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {42910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:10:57,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {42911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:10:57,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {42912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:10:57,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {42913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:10:57,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {42914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:10:57,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {42915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:10:57,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {42916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:10:57,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {42917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:10:57,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {42918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:10:57,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {42919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:10:57,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {42920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:10:57,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {42921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:10:57,968 INFO L290 TraceCheckUtils]: 50: Hoare triple {42922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:10:57,968 INFO L290 TraceCheckUtils]: 51: Hoare triple {42923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:10:57,969 INFO L290 TraceCheckUtils]: 52: Hoare triple {42924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:10:57,969 INFO L290 TraceCheckUtils]: 53: Hoare triple {42925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:10:57,970 INFO L290 TraceCheckUtils]: 54: Hoare triple {42926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:10:57,970 INFO L290 TraceCheckUtils]: 55: Hoare triple {42927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:10:57,971 INFO L290 TraceCheckUtils]: 56: Hoare triple {42928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42929#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:10:57,971 INFO L290 TraceCheckUtils]: 57: Hoare triple {42929#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42930#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:10:57,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {42930#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42931#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:10:57,972 INFO L290 TraceCheckUtils]: 59: Hoare triple {42931#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42932#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:10:57,973 INFO L290 TraceCheckUtils]: 60: Hoare triple {42932#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42933#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:10:57,973 INFO L290 TraceCheckUtils]: 61: Hoare triple {42933#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42934#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:10:57,974 INFO L290 TraceCheckUtils]: 62: Hoare triple {42934#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42935#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:10:57,974 INFO L290 TraceCheckUtils]: 63: Hoare triple {42935#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42936#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:10:57,975 INFO L290 TraceCheckUtils]: 64: Hoare triple {42936#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42937#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:10:57,975 INFO L290 TraceCheckUtils]: 65: Hoare triple {42937#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42938#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:10:57,976 INFO L290 TraceCheckUtils]: 66: Hoare triple {42938#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42939#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-15 06:10:57,976 INFO L290 TraceCheckUtils]: 67: Hoare triple {42939#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42940#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-15 06:10:57,976 INFO L290 TraceCheckUtils]: 68: Hoare triple {42940#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42941#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-15 06:10:57,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {42941#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43154#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-15 06:10:57,977 INFO L290 TraceCheckUtils]: 70: Hoare triple {43154#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !(~x~0 % 4294967296 < 268435455); {42874#false} is VALID [2022-04-15 06:10:57,977 INFO L272 TraceCheckUtils]: 71: Hoare triple {42874#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {42874#false} is VALID [2022-04-15 06:10:57,978 INFO L290 TraceCheckUtils]: 72: Hoare triple {42874#false} ~cond := #in~cond; {42874#false} is VALID [2022-04-15 06:10:57,978 INFO L290 TraceCheckUtils]: 73: Hoare triple {42874#false} assume 0 == ~cond; {42874#false} is VALID [2022-04-15 06:10:57,978 INFO L290 TraceCheckUtils]: 74: Hoare triple {42874#false} assume !false; {42874#false} is VALID [2022-04-15 06:10:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:10:57,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:11:04,404 INFO L290 TraceCheckUtils]: 74: Hoare triple {42874#false} assume !false; {42874#false} is VALID [2022-04-15 06:11:04,405 INFO L290 TraceCheckUtils]: 73: Hoare triple {42874#false} assume 0 == ~cond; {42874#false} is VALID [2022-04-15 06:11:04,405 INFO L290 TraceCheckUtils]: 72: Hoare triple {42874#false} ~cond := #in~cond; {42874#false} is VALID [2022-04-15 06:11:04,405 INFO L272 TraceCheckUtils]: 71: Hoare triple {42874#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {42874#false} is VALID [2022-04-15 06:11:04,405 INFO L290 TraceCheckUtils]: 70: Hoare triple {43182#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {42874#false} is VALID [2022-04-15 06:11:04,406 INFO L290 TraceCheckUtils]: 69: Hoare triple {43186#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43182#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,407 INFO L290 TraceCheckUtils]: 68: Hoare triple {43190#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43186#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,407 INFO L290 TraceCheckUtils]: 67: Hoare triple {43194#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43190#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {43198#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43194#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,411 INFO L290 TraceCheckUtils]: 65: Hoare triple {43202#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43198#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,412 INFO L290 TraceCheckUtils]: 64: Hoare triple {43206#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43202#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,412 INFO L290 TraceCheckUtils]: 63: Hoare triple {43210#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43206#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,413 INFO L290 TraceCheckUtils]: 62: Hoare triple {43214#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43210#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,414 INFO L290 TraceCheckUtils]: 61: Hoare triple {43218#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43214#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,414 INFO L290 TraceCheckUtils]: 60: Hoare triple {43222#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43218#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,415 INFO L290 TraceCheckUtils]: 59: Hoare triple {43226#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43222#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {43230#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43226#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {43234#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43230#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {43238#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43234#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,417 INFO L290 TraceCheckUtils]: 55: Hoare triple {43242#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43238#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,418 INFO L290 TraceCheckUtils]: 54: Hoare triple {43246#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43242#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,418 INFO L290 TraceCheckUtils]: 53: Hoare triple {43250#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43246#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {43254#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43250#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {43258#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43254#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {43262#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43258#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {43266#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43262#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {43270#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43266#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {43274#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43270#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {43278#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43274#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {43282#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43278#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {43286#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43282#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {43290#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43286#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {43294#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43290#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {43298#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43294#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {43302#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43298#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {43306#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43302#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {43310#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43306#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {43314#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43310#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {43318#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43314#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {43322#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43318#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {43326#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43322#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {43330#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43326#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {43334#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43330#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {43338#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43334#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {43342#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43338#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {43346#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43342#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {43350#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43346#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {43354#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43350#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {43358#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43354#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {43362#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43358#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {43366#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43362#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {43370#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43366#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {43374#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43370#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {43378#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43374#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {43382#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43378#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {43386#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43382#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {43390#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43386#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {43394#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43390#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {43398#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43394#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {43402#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43398#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {43406#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43402#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {43410#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43406#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {43414#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43410#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {43418#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43414#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {43422#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43418#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {43426#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43422#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {43430#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43426#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {43434#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43430#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {43438#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43434#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {42873#true} ~x~0 := 0; {43438#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} is VALID [2022-04-15 06:11:04,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {42873#true} call #t~ret4 := main(); {42873#true} is VALID [2022-04-15 06:11:04,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42873#true} {42873#true} #34#return; {42873#true} is VALID [2022-04-15 06:11:04,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {42873#true} assume true; {42873#true} is VALID [2022-04-15 06:11:04,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {42873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {42873#true} is VALID [2022-04-15 06:11:04,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {42873#true} call ULTIMATE.init(); {42873#true} is VALID [2022-04-15 06:11:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:04,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138579433] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:11:04,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:11:04,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67, 67] total 134 [2022-04-15 06:11:04,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:04,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1597526629] [2022-04-15 06:11:04,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1597526629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:04,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:04,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-15 06:11:04,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814396780] [2022-04-15 06:11:04,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:04,452 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 06:11:04,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:04,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:04,491 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-15 06:11:04,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-15 06:11:04,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:04,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-15 06:11:04,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4620, Invalid=13202, Unknown=0, NotChecked=0, Total=17822 [2022-04-15 06:11:04,493 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:13,147 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-15 06:11:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-15 06:11:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 06:11:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2022-04-15 06:11:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2022-04-15 06:11:13,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 82 transitions. [2022-04-15 06:11:13,209 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-15 06:11:13,210 INFO L225 Difference]: With dead ends: 82 [2022-04-15 06:11:13,210 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 06:11:13,212 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2214 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=9233, Invalid=30169, Unknown=0, NotChecked=0, Total=39402 [2022-04-15 06:11:13,212 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 4482 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 4613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 4482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:13,212 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 333 Invalid, 4613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 4482 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 06:11:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 06:11:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-15 06:11:13,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:13,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,312 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,313 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:13,313 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-15 06:11:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-15 06:11:13,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:13,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:13,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 06:11:13,314 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 06:11:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:13,314 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-15 06:11:13,315 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-15 06:11:13,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:13,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:13,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:13,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-04-15 06:11:13,316 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2022-04-15 06:11:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:13,316 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-04-15 06:11:13,316 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:13,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 77 transitions. [2022-04-15 06:11:13,384 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-15 06:11:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-15 06:11:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 06:11:13,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:13,385 INFO L499 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:13,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2022-04-15 06:11:13,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2022-04-15 06:11:13,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:11:13,785 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:13,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:13,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1846271370, now seen corresponding path program 129 times [2022-04-15 06:11:13,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:13,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [848498832] [2022-04-15 06:11:14,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:11:14,020 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:11:14,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1915434231, now seen corresponding path program 1 times [2022-04-15 06:11:14,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:14,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864732228] [2022-04-15 06:11:14,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:14,027 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_65.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_65.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 06:11:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:11:14,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501002000] [2022-04-15 06:11:14,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:14,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:11:14,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:11:14,032 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:11:14,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-04-15 06:11:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:11:14,087 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:11:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:11:14,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:11:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1846271370, now seen corresponding path program 130 times [2022-04-15 06:11:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:14,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195507275] [2022-04-15 06:11:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:16,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:16,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {44132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {44061#true} is VALID [2022-04-15 06:11:16,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {44061#true} assume true; {44061#true} is VALID [2022-04-15 06:11:16,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44061#true} {44061#true} #34#return; {44061#true} is VALID [2022-04-15 06:11:16,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {44061#true} call ULTIMATE.init(); {44132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:11:16,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {44132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {44061#true} is VALID [2022-04-15 06:11:16,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {44061#true} assume true; {44061#true} is VALID [2022-04-15 06:11:16,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44061#true} {44061#true} #34#return; {44061#true} is VALID [2022-04-15 06:11:16,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {44061#true} call #t~ret4 := main(); {44061#true} is VALID [2022-04-15 06:11:16,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {44061#true} ~x~0 := 0; {44066#(= main_~x~0 0)} is VALID [2022-04-15 06:11:16,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {44066#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:11:16,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {44067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44068#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:11:16,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {44068#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44069#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:11:16,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {44069#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44070#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:11:16,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {44070#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44071#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:11:16,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {44071#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44072#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:11:16,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {44072#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44073#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:11:16,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {44073#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44074#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:11:16,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {44074#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44075#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:11:16,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {44075#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44076#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:11:16,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {44076#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44077#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:11:16,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {44077#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44078#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:11:16,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {44078#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44079#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:11:16,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {44079#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44080#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:11:16,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {44080#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44081#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:11:16,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {44081#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44082#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:11:16,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {44082#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44083#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:11:16,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {44083#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44084#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:11:16,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {44084#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44085#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:11:16,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {44085#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44086#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:11:16,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {44086#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44087#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:11:16,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {44087#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44088#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:11:16,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {44088#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44089#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:11:16,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {44089#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44090#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:11:16,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {44090#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44091#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:11:16,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {44091#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44092#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:11:16,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {44092#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44093#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:11:16,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {44093#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44094#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:11:16,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {44094#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44095#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:11:16,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {44095#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44096#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:11:16,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {44096#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44097#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:11:16,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {44097#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44098#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:11:16,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {44098#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44099#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:11:16,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {44099#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44100#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:11:16,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {44100#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44101#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:11:16,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {44101#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44102#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:11:16,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {44102#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44103#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:11:16,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {44103#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44104#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:11:16,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {44104#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44105#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:11:16,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {44105#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44106#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:11:16,622 INFO L290 TraceCheckUtils]: 46: Hoare triple {44106#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44107#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:11:16,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {44107#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44108#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:11:16,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {44108#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44109#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:11:16,623 INFO L290 TraceCheckUtils]: 49: Hoare triple {44109#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44110#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:11:16,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {44110#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44111#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:11:16,624 INFO L290 TraceCheckUtils]: 51: Hoare triple {44111#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44112#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:11:16,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {44112#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44113#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:11:16,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {44113#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44114#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:11:16,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {44114#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44115#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:11:16,627 INFO L290 TraceCheckUtils]: 55: Hoare triple {44115#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44116#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:11:16,627 INFO L290 TraceCheckUtils]: 56: Hoare triple {44116#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44117#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:11:16,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {44117#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44118#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:11:16,629 INFO L290 TraceCheckUtils]: 58: Hoare triple {44118#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44119#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:11:16,629 INFO L290 TraceCheckUtils]: 59: Hoare triple {44119#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44120#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:11:16,630 INFO L290 TraceCheckUtils]: 60: Hoare triple {44120#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44121#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:11:16,630 INFO L290 TraceCheckUtils]: 61: Hoare triple {44121#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44122#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:11:16,631 INFO L290 TraceCheckUtils]: 62: Hoare triple {44122#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44123#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:11:16,632 INFO L290 TraceCheckUtils]: 63: Hoare triple {44123#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44124#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:11:16,632 INFO L290 TraceCheckUtils]: 64: Hoare triple {44124#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44125#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:11:16,633 INFO L290 TraceCheckUtils]: 65: Hoare triple {44125#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44126#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:11:16,633 INFO L290 TraceCheckUtils]: 66: Hoare triple {44126#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44127#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-15 06:11:16,634 INFO L290 TraceCheckUtils]: 67: Hoare triple {44127#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44128#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-15 06:11:16,634 INFO L290 TraceCheckUtils]: 68: Hoare triple {44128#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44129#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-15 06:11:16,635 INFO L290 TraceCheckUtils]: 69: Hoare triple {44129#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44130#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-15 06:11:16,636 INFO L290 TraceCheckUtils]: 70: Hoare triple {44130#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44131#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 130))} is VALID [2022-04-15 06:11:16,636 INFO L290 TraceCheckUtils]: 71: Hoare triple {44131#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 130))} assume !(~x~0 % 4294967296 < 268435455); {44062#false} is VALID [2022-04-15 06:11:16,636 INFO L272 TraceCheckUtils]: 72: Hoare triple {44062#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {44062#false} is VALID [2022-04-15 06:11:16,636 INFO L290 TraceCheckUtils]: 73: Hoare triple {44062#false} ~cond := #in~cond; {44062#false} is VALID [2022-04-15 06:11:16,636 INFO L290 TraceCheckUtils]: 74: Hoare triple {44062#false} assume 0 == ~cond; {44062#false} is VALID [2022-04-15 06:11:16,637 INFO L290 TraceCheckUtils]: 75: Hoare triple {44062#false} assume !false; {44062#false} is VALID [2022-04-15 06:11:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:16,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:16,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195507275] [2022-04-15 06:11:16,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195507275] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:11:16,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417268984] [2022-04-15 06:11:16,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:11:16,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:11:16,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:11:16,639 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:11:16,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-04-15 06:11:17,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:11:17,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:11:17,236 WARN L261 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 133 conjunts are in the unsatisfiable core [2022-04-15 06:11:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:17,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:11:18,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {44061#true} call ULTIMATE.init(); {44061#true} is VALID [2022-04-15 06:11:18,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {44061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {44061#true} is VALID [2022-04-15 06:11:18,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {44061#true} assume true; {44061#true} is VALID [2022-04-15 06:11:18,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44061#true} {44061#true} #34#return; {44061#true} is VALID [2022-04-15 06:11:18,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {44061#true} call #t~ret4 := main(); {44061#true} is VALID [2022-04-15 06:11:18,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {44061#true} ~x~0 := 0; {44066#(= main_~x~0 0)} is VALID [2022-04-15 06:11:18,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {44066#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:11:18,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {44067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44068#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:11:18,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {44068#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44069#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:11:18,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {44069#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44070#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:11:18,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {44070#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44071#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:11:18,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {44071#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44072#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:11:18,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {44072#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44073#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:11:18,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {44073#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44074#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:11:18,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {44074#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44075#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:11:18,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {44075#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44076#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:11:18,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {44076#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44077#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:11:18,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {44077#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44078#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:11:18,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {44078#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44079#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:11:18,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {44079#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44080#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:11:18,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {44080#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44081#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:11:18,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {44081#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44082#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:11:18,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {44082#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44083#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:11:18,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {44083#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44084#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:11:18,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {44084#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44085#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:11:18,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {44085#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44086#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:11:18,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {44086#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44087#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:11:18,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {44087#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44088#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:11:18,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {44088#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44089#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:11:18,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {44089#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44090#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:11:18,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {44090#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44091#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:11:18,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {44091#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44092#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:11:18,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {44092#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44093#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:11:18,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {44093#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44094#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:11:18,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {44094#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44095#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:11:18,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {44095#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44096#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:11:18,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {44096#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44097#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:11:18,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {44097#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44098#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:11:18,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {44098#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44099#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:11:18,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {44099#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44100#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:11:18,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {44100#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44101#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:11:18,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {44101#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44102#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:11:18,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {44102#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44103#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:11:18,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {44103#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44104#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:11:18,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {44104#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44105#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:11:18,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {44105#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44106#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:11:18,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {44106#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44107#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:11:18,561 INFO L290 TraceCheckUtils]: 47: Hoare triple {44107#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44108#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:11:18,562 INFO L290 TraceCheckUtils]: 48: Hoare triple {44108#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44109#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:11:18,562 INFO L290 TraceCheckUtils]: 49: Hoare triple {44109#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44110#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:11:18,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {44110#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44111#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:11:18,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {44111#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44112#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:11:18,564 INFO L290 TraceCheckUtils]: 52: Hoare triple {44112#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44113#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:11:18,565 INFO L290 TraceCheckUtils]: 53: Hoare triple {44113#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44114#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:11:18,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {44114#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44115#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:11:18,566 INFO L290 TraceCheckUtils]: 55: Hoare triple {44115#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44116#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:11:18,566 INFO L290 TraceCheckUtils]: 56: Hoare triple {44116#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44117#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:11:18,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {44117#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44118#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:11:18,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {44118#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44119#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:11:18,568 INFO L290 TraceCheckUtils]: 59: Hoare triple {44119#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44120#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:11:18,569 INFO L290 TraceCheckUtils]: 60: Hoare triple {44120#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44121#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:11:18,569 INFO L290 TraceCheckUtils]: 61: Hoare triple {44121#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44122#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:11:18,570 INFO L290 TraceCheckUtils]: 62: Hoare triple {44122#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44123#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:11:18,570 INFO L290 TraceCheckUtils]: 63: Hoare triple {44123#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44124#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:11:18,571 INFO L290 TraceCheckUtils]: 64: Hoare triple {44124#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44125#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:11:18,571 INFO L290 TraceCheckUtils]: 65: Hoare triple {44125#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44126#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:11:18,572 INFO L290 TraceCheckUtils]: 66: Hoare triple {44126#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44127#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-15 06:11:18,573 INFO L290 TraceCheckUtils]: 67: Hoare triple {44127#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44128#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-15 06:11:18,573 INFO L290 TraceCheckUtils]: 68: Hoare triple {44128#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44129#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-15 06:11:18,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {44129#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44130#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-15 06:11:18,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {44130#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44346#(and (<= 130 main_~x~0) (<= main_~x~0 130))} is VALID [2022-04-15 06:11:18,575 INFO L290 TraceCheckUtils]: 71: Hoare triple {44346#(and (<= 130 main_~x~0) (<= main_~x~0 130))} assume !(~x~0 % 4294967296 < 268435455); {44062#false} is VALID [2022-04-15 06:11:18,575 INFO L272 TraceCheckUtils]: 72: Hoare triple {44062#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {44062#false} is VALID [2022-04-15 06:11:18,575 INFO L290 TraceCheckUtils]: 73: Hoare triple {44062#false} ~cond := #in~cond; {44062#false} is VALID [2022-04-15 06:11:18,575 INFO L290 TraceCheckUtils]: 74: Hoare triple {44062#false} assume 0 == ~cond; {44062#false} is VALID [2022-04-15 06:11:18,575 INFO L290 TraceCheckUtils]: 75: Hoare triple {44062#false} assume !false; {44062#false} is VALID [2022-04-15 06:11:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:18,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:11:26,507 INFO L290 TraceCheckUtils]: 75: Hoare triple {44062#false} assume !false; {44062#false} is VALID [2022-04-15 06:11:26,507 INFO L290 TraceCheckUtils]: 74: Hoare triple {44062#false} assume 0 == ~cond; {44062#false} is VALID [2022-04-15 06:11:26,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {44062#false} ~cond := #in~cond; {44062#false} is VALID [2022-04-15 06:11:26,507 INFO L272 TraceCheckUtils]: 72: Hoare triple {44062#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {44062#false} is VALID [2022-04-15 06:11:26,508 INFO L290 TraceCheckUtils]: 71: Hoare triple {44374#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {44062#false} is VALID [2022-04-15 06:11:26,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {44378#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44374#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,509 INFO L290 TraceCheckUtils]: 69: Hoare triple {44382#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44378#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,510 INFO L290 TraceCheckUtils]: 68: Hoare triple {44386#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44382#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,512 INFO L290 TraceCheckUtils]: 67: Hoare triple {44390#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44386#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,513 INFO L290 TraceCheckUtils]: 66: Hoare triple {44394#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44390#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,514 INFO L290 TraceCheckUtils]: 65: Hoare triple {44398#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44394#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,514 INFO L290 TraceCheckUtils]: 64: Hoare triple {44402#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44398#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,515 INFO L290 TraceCheckUtils]: 63: Hoare triple {44406#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44402#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {44410#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44406#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {44414#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44410#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,517 INFO L290 TraceCheckUtils]: 60: Hoare triple {44418#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44414#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,518 INFO L290 TraceCheckUtils]: 59: Hoare triple {44422#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44418#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,519 INFO L290 TraceCheckUtils]: 58: Hoare triple {44426#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44422#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {44430#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44426#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {44434#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44430#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {44438#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44434#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {44442#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44438#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {44446#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44442#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {44450#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44446#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,524 INFO L290 TraceCheckUtils]: 51: Hoare triple {44454#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44450#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,525 INFO L290 TraceCheckUtils]: 50: Hoare triple {44458#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44454#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {44462#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44458#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {44466#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44462#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {44470#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44466#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {44474#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44470#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {44478#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44474#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {44482#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44478#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {44486#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44482#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {44490#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44486#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {44494#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44490#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {44498#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44494#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {44502#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44498#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {44506#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44502#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {44510#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44506#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {44514#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44510#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {44518#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44514#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {44522#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44518#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {44526#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44522#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {44530#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44526#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {44534#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44530#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {44538#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44534#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {44542#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44538#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {44546#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44542#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {44550#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44546#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {44554#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44550#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {44558#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44554#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {44562#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44558#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {44566#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44562#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {44570#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44566#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {44574#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44570#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {44578#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44574#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {44582#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44578#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {44586#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44582#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {44590#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44586#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {44594#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44590#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {44598#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44594#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {44602#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44598#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {44606#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44602#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {44610#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44606#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {44614#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44610#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {44618#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44614#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {44622#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44618#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {44626#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44622#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {44630#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44626#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {44634#(< (mod (+ main_~x~0 130) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44630#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {44061#true} ~x~0 := 0; {44634#(< (mod (+ main_~x~0 130) 4294967296) 268435455)} is VALID [2022-04-15 06:11:26,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {44061#true} call #t~ret4 := main(); {44061#true} is VALID [2022-04-15 06:11:26,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44061#true} {44061#true} #34#return; {44061#true} is VALID [2022-04-15 06:11:26,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {44061#true} assume true; {44061#true} is VALID [2022-04-15 06:11:26,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {44061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {44061#true} is VALID [2022-04-15 06:11:26,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {44061#true} call ULTIMATE.init(); {44061#true} is VALID [2022-04-15 06:11:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:26,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417268984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:11:26,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:11:26,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 68, 68] total 136 [2022-04-15 06:11:26,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:11:26,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [848498832] [2022-04-15 06:11:26,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [848498832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:11:26,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:11:26,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-15 06:11:26,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279356340] [2022-04-15 06:11:26,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:11:26,573 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 06:11:26,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:11:26,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:26,620 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-15 06:11:26,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-15 06:11:26,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:26,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-15 06:11:26,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4757, Invalid=13603, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 06:11:26,622 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:37,030 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2022-04-15 06:11:37,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-15 06:11:37,030 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-15 06:11:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:11:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2022-04-15 06:11:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2022-04-15 06:11:37,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 83 transitions. [2022-04-15 06:11:37,120 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-15 06:11:37,121 INFO L225 Difference]: With dead ends: 83 [2022-04-15 06:11:37,121 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 06:11:37,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=9507, Invalid=31095, Unknown=0, NotChecked=0, Total=40602 [2022-04-15 06:11:37,124 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 4622 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 4622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:11:37,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 343 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 4622 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-15 06:11:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 06:11:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-15 06:11:37,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:11:37,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:37,225 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:37,225 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:37,226 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-15 06:11:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-15 06:11:37,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:37,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:37,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-15 06:11:37,226 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-15 06:11:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:11:37,227 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-15 06:11:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-15 06:11:37,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:11:37,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:11:37,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:11:37,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:11:37,228 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-15 06:11:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2022-04-15 06:11:37,229 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2022-04-15 06:11:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:11:37,229 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2022-04-15 06:11:37,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:11:37,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 78 transitions. [2022-04-15 06:11:37,299 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-15 06:11:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-15 06:11:37,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 06:11:37,299 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:11:37,299 INFO L499 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:11:37,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Forceful destruction successful, exit code 0 [2022-04-15 06:11:37,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2022-04-15 06:11:37,700 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable130,SelfDestructingSolverStorable131,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:11:37,700 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:11:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:11:37,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1363376356, now seen corresponding path program 131 times [2022-04-15 06:11:37,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:11:37,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [468174698] [2022-04-15 06:11:37,922 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:11:37,923 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:11:37,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1974539575, now seen corresponding path program 1 times [2022-04-15 06:11:37,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:37,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977013442] [2022-04-15 06:11:37,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:37,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:37,930 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_66.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_66.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-15 06:11:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:11:37,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472895204] [2022-04-15 06:11:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:37,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:11:37,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:11:37,934 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:11:37,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2022-04-15 06:11:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:11:38,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:11:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:11:38,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:11:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1363376356, now seen corresponding path program 132 times [2022-04-15 06:11:38,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:11:38,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722770806] [2022-04-15 06:11:38,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:11:38,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:11:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:40,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:11:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:11:40,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {45337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {45265#true} is VALID [2022-04-15 06:11:40,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {45265#true} assume true; {45265#true} is VALID [2022-04-15 06:11:40,564 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45265#true} {45265#true} #34#return; {45265#true} is VALID [2022-04-15 06:11:40,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {45265#true} call ULTIMATE.init(); {45337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:11:40,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {45337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {45265#true} is VALID [2022-04-15 06:11:40,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {45265#true} assume true; {45265#true} is VALID [2022-04-15 06:11:40,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45265#true} {45265#true} #34#return; {45265#true} is VALID [2022-04-15 06:11:40,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {45265#true} call #t~ret4 := main(); {45265#true} is VALID [2022-04-15 06:11:40,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {45265#true} ~x~0 := 0; {45270#(= main_~x~0 0)} is VALID [2022-04-15 06:11:40,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {45270#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:11:40,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {45271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45272#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:11:40,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {45272#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45273#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 06:11:40,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {45273#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45274#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 06:11:40,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {45274#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 06:11:40,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {45275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45276#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 06:11:40,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {45276#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45277#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 06:11:40,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {45277#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45278#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 06:11:40,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {45278#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45279#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 06:11:40,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {45279#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45280#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 06:11:40,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {45280#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45281#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 06:11:40,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {45281#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45282#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 06:11:40,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {45282#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45283#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 06:11:40,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {45283#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45284#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 06:11:40,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {45284#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45285#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 06:11:40,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {45285#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45286#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 06:11:40,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {45286#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45287#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 06:11:40,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {45287#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45288#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 06:11:40,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {45288#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45289#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-15 06:11:40,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {45289#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45290#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-15 06:11:40,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {45290#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45291#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-15 06:11:40,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {45291#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45292#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-15 06:11:40,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {45292#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45293#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-15 06:11:40,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {45293#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45294#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-15 06:11:40,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {45294#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45295#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-15 06:11:40,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {45295#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-15 06:11:40,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {45296#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45297#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-15 06:11:40,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {45297#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45298#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-15 06:11:40,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {45298#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45299#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-15 06:11:40,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {45299#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45300#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-15 06:11:40,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {45300#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45301#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-15 06:11:40,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {45301#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45302#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-15 06:11:40,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {45302#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45303#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-15 06:11:40,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {45303#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45304#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-15 06:11:40,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {45304#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45305#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-15 06:11:40,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {45305#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45306#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-15 06:11:40,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {45306#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45307#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-15 06:11:40,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {45307#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45308#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-15 06:11:40,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {45308#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45309#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-15 06:11:40,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {45309#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45310#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-15 06:11:40,589 INFO L290 TraceCheckUtils]: 46: Hoare triple {45310#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45311#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-15 06:11:40,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {45311#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45312#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-15 06:11:40,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {45312#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45313#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-15 06:11:40,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {45313#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45314#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-15 06:11:40,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {45314#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45315#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-15 06:11:40,592 INFO L290 TraceCheckUtils]: 51: Hoare triple {45315#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45316#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-15 06:11:40,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {45316#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45317#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-15 06:11:40,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {45317#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45318#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-15 06:11:40,594 INFO L290 TraceCheckUtils]: 54: Hoare triple {45318#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45319#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-15 06:11:40,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {45319#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45320#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-15 06:11:40,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {45320#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45321#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-15 06:11:40,596 INFO L290 TraceCheckUtils]: 57: Hoare triple {45321#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45322#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-15 06:11:40,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {45322#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45323#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-15 06:11:40,597 INFO L290 TraceCheckUtils]: 59: Hoare triple {45323#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45324#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-15 06:11:40,597 INFO L290 TraceCheckUtils]: 60: Hoare triple {45324#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45325#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-15 06:11:40,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {45325#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45326#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-15 06:11:40,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {45326#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45327#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-15 06:11:40,599 INFO L290 TraceCheckUtils]: 63: Hoare triple {45327#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45328#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-15 06:11:40,600 INFO L290 TraceCheckUtils]: 64: Hoare triple {45328#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45329#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-15 06:11:40,600 INFO L290 TraceCheckUtils]: 65: Hoare triple {45329#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45330#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-15 06:11:40,601 INFO L290 TraceCheckUtils]: 66: Hoare triple {45330#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45331#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-15 06:11:40,601 INFO L290 TraceCheckUtils]: 67: Hoare triple {45331#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45332#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-15 06:11:40,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {45332#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45333#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-15 06:11:40,603 INFO L290 TraceCheckUtils]: 69: Hoare triple {45333#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45334#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-15 06:11:40,603 INFO L290 TraceCheckUtils]: 70: Hoare triple {45334#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45335#(and (<= 130 main_~x~0) (<= main_~x~0 130))} is VALID [2022-04-15 06:11:40,604 INFO L290 TraceCheckUtils]: 71: Hoare triple {45335#(and (<= 130 main_~x~0) (<= main_~x~0 130))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45336#(and (<= main_~x~0 132) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:11:40,604 INFO L290 TraceCheckUtils]: 72: Hoare triple {45336#(and (<= main_~x~0 132) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {45266#false} is VALID [2022-04-15 06:11:40,604 INFO L272 TraceCheckUtils]: 73: Hoare triple {45266#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 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {45266#false} is VALID [2022-04-15 06:11:40,623 INFO L290 TraceCheckUtils]: 74: Hoare triple {45266#false} ~cond := #in~cond; {45266#false} is VALID [2022-04-15 06:11:40,623 INFO L290 TraceCheckUtils]: 75: Hoare triple {45266#false} assume 0 == ~cond; {45266#false} is VALID [2022-04-15 06:11:40,624 INFO L290 TraceCheckUtils]: 76: Hoare triple {45266#false} assume !false; {45266#false} is VALID [2022-04-15 06:11:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:11:40,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:11:40,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722770806] [2022-04-15 06:11:40,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722770806] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:11:40,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064632988] [2022-04-15 06:11:40,625 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:11:40,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:11:40,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:11:40,626 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:11:40,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process