/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_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:01:11,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:01:11,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:01:11,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:01:11,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:01:11,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:01:11,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:01:11,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:01:11,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:01:11,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:01:11,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:01:11,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:01:11,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:01:11,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:01:11,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:01:11,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:01:11,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:01:11,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:01:11,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:01:11,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:01:11,297 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:01:11,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:01:11,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:01:11,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:01:11,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:01:11,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:01:11,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:01:11,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:01:11,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:01:11,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:01:11,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:01:11,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:01:11,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:01:11,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:01:11,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:01:11,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:01:11,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:01:11,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:01:11,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:01:11,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:01:11,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:01:11,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:01:11,312 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 06:01:11,319 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:01:11,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:01:11,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:01:11,320 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:01:11,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:01:11,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:01:11,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:01:11,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:01:11,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:01:11,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:01:11,322 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:01:11,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:01:11,322 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:01:11,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:01:11,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:01:11,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:01:11,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:01:11,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:01:11,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:01:11,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:01:11,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:01:11,323 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:01:11,323 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:01:11,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:01:11,323 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:01:11,323 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 06:01:11,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:01:11,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:01:11,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:01:11,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:01:11,530 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:01:11,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_4-1.c [2022-04-15 06:01:11,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c24e0b91/4c43628f96fa480c892108ba5afc107b/FLAGb223d8473 [2022-04-15 06:01:11,913 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:01:11,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_4-1.c [2022-04-15 06:01:11,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c24e0b91/4c43628f96fa480c892108ba5afc107b/FLAGb223d8473 [2022-04-15 06:01:11,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c24e0b91/4c43628f96fa480c892108ba5afc107b [2022-04-15 06:01:11,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:01:11,927 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:01:11,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:01:11,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:01:11,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:01:11,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:01:11" (1/1) ... [2022-04-15 06:01:11,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195e6933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:01:11, skipping insertion in model container [2022-04-15 06:01:11,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:01:11" (1/1) ... [2022-04-15 06:01:11,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:01:11,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:01:12,079 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_4-1.c[322,335] [2022-04-15 06:01:12,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:01:12,098 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:01:12,107 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_4-1.c[322,335] [2022-04-15 06:01:12,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:01:12,125 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:01:12,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:01:12 WrapperNode [2022-04-15 06:01:12,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:01:12,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:01:12,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:01:12,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:01:12,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:01:12" (1/1) ... [2022-04-15 06:01:12,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:01:12" (1/1) ... [2022-04-15 06:01:12,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:01:12" (1/1) ... [2022-04-15 06:01:12,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:01:12" (1/1) ... [2022-04-15 06:01:12,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:01:12" (1/1) ... [2022-04-15 06:01:12,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:01:12" (1/1) ... [2022-04-15 06:01:12,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:01:12" (1/1) ... [2022-04-15 06:01:12,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:01:12,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:01:12,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:01:12,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:01:12,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:01:12" (1/1) ... [2022-04-15 06:01:12,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:01:12,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:12,177 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 06:01:12,195 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 06:01:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:01:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:01:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:01:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:01:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:01:12,209 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:01:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:01:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:01:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:01:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:01:12,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:01:12,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:01:12,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:01:12,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:01:12,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:01:12,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:01:12,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:01:12,259 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:01:12,260 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:01:12,340 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:01:12,344 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:01:12,345 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:01:12,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:01:12 BoogieIcfgContainer [2022-04-15 06:01:12,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:01:12,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:01:12,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:01:12,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:01:12,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:01:11" (1/3) ... [2022-04-15 06:01:12,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1368e25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:01:12, skipping insertion in model container [2022-04-15 06:01:12,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:01:12" (2/3) ... [2022-04-15 06:01:12,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1368e25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:01:12, skipping insertion in model container [2022-04-15 06:01:12,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:01:12" (3/3) ... [2022-04-15 06:01:12,351 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_4-1.c [2022-04-15 06:01:12,354 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:01:12,354 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:01:12,400 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:01:12,404 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 06:01:12,404 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:01:12,423 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 06:01:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:01:12,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:12,427 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:12,428 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-15 06:01:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:12,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1921883609] [2022-04-15 06:01:12,457 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:01:12,457 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-15 06:01:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:12,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174463541] [2022-04-15 06:01:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:12,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:12,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:12,606 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 06:01:12,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 06:01:12,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 06:01:12,609 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 06:01:12,609 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 06:01:12,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 06:01:12,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 06:01:12,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2022-04-15 06:01:12,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 268435441; {21#true} is VALID [2022-04-15 06:01:12,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-15 06:01:12,611 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-15 06:01:12,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-15 06:01:12,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-15 06:01:12,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 06:01:12,613 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 06:01:12,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:12,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174463541] [2022-04-15 06:01:12,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174463541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:12,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:12,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:01:12,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:12,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1921883609] [2022-04-15 06:01:12,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1921883609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:12,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:12,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:01:12,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855609517] [2022-04-15 06:01:12,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:12,621 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 06:01:12,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:12,624 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 06:01:12,644 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 06:01:12,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:01:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:12,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:01:12,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:01:12,669 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 06:01:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:12,736 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 06:01:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:01:12,736 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 06:01:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:12,737 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 06:01:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 06:01:12,741 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 06:01:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 06:01:12,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-15 06:01:12,804 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:01:12,809 INFO L225 Difference]: With dead ends: 29 [2022-04-15 06:01:12,809 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 06:01:12,810 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 06:01:12,813 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 06:01:12,813 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 06:01:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 06:01:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 06:01:12,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:12,842 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 06:01:12,843 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 06:01:12,844 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 06:01:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:12,850 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 06:01:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 06:01:12,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:12,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:12,851 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 06:01:12,851 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 06:01:12,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:12,854 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 06:01:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 06:01:12,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:12,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:12,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:12,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:12,855 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 06:01:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 06:01:12,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-15 06:01:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:12,859 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 06:01:12,860 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 06:01:12,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-15 06:01:12,878 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 06:01:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 06:01:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:01:12,882 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:12,882 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:12,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:01:12,887 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-15 06:01:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:12,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [571601468] [2022-04-15 06:01:12,890 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:01:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-15 06:01:12,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:12,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498331798] [2022-04-15 06:01:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:12,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:12,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:13,005 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 06:01:13,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 06:01:13,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 06:01:13,006 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 06:01:13,006 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 06:01:13,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 06:01:13,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 06:01:13,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret4 := main(); {135#true} is VALID [2022-04-15 06:01:13,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 268435441; {140#(and (<= (div main_~x~0 4294967296) 0) (<= 268435441 main_~x~0))} is VALID [2022-04-15 06:01:13,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(and (<= (div main_~x~0 4294967296) 0) (<= 268435441 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {136#false} is VALID [2022-04-15 06:01:13,010 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {136#false} is VALID [2022-04-15 06:01:13,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-15 06:01:13,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-15 06:01:13,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-15 06:01:13,011 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 06:01:13,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:13,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498331798] [2022-04-15 06:01:13,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498331798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:13,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:13,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:01:13,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:13,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [571601468] [2022-04-15 06:01:13,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [571601468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:13,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:13,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:01:13,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839889065] [2022-04-15 06:01:13,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:13,014 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 06:01:13,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:13,015 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 06:01:13,030 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 06:01:13,030 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:01:13,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:13,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:01:13,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:01:13,032 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 06:01:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:13,084 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 06:01:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:01:13,084 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 06:01:13,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:13,085 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 06:01:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 06:01:13,086 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 06:01:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 06:01:13,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-15 06:01:13,106 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 06:01:13,108 INFO L225 Difference]: With dead ends: 18 [2022-04-15 06:01:13,108 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 06:01:13,109 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 06:01:13,112 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 06:01:13,112 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 06:01:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 06:01:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 06:01:13,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:13,119 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 06:01:13,119 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 06:01:13,120 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 06:01:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:13,121 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 06:01:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 06:01:13,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:13,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:13,122 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 06:01:13,122 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 06:01:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:13,123 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 06:01:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 06:01:13,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:13,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:13,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:13,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:13,124 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 06:01:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 06:01:13,125 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 06:01:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:13,126 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 06:01:13,127 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 06:01:13,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 06:01:13,137 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 06:01:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 06:01:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:01:13,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:13,138 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:13,138 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:01:13,138 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:13,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-15 06:01:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:13,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [171066559] [2022-04-15 06:01:15,517 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:15,520 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:15,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1867307785, now seen corresponding path program 1 times [2022-04-15 06:01:15,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:15,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816782532] [2022-04-15 06:01:15,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:15,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:15,543 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:15,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004065617] [2022-04-15 06:01:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:15,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:15,591 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 06:01:15,619 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 06:01:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:15,676 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:15,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-15 06:01:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:15,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007564534] [2022-04-15 06:01:15,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:15,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:15,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:15,779 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 06:01:15,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 06:01:15,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 06:01:15,780 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 06:01:15,781 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 06:01:15,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 06:01:15,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 06:01:15,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 06:01:15,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 268435441; {239#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:15,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {240#(and (<= 268435439 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:01:15,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (<= 268435439 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {235#false} is VALID [2022-04-15 06:01:15,783 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-15 06:01:15,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 06:01:15,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 06:01:15,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 06:01:15,784 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 06:01:15,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:15,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007564534] [2022-04-15 06:01:15,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007564534] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:15,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355160467] [2022-04-15 06:01:15,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:15,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:15,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:15,812 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 06:01:15,824 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 06:01:15,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:15,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:15,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:01:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:15,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:15,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-15 06:01:15,941 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 06:01:15,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 06:01:15,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 06:01:15,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 06:01:15,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 268435441; {239#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:15,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {263#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:15,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !(~x~0 % 4294967296 > 1); {235#false} is VALID [2022-04-15 06:01:15,947 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-15 06:01:15,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 06:01:15,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 06:01:15,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 06:01:15,948 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 06:01:15,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:16,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 06:01:16,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {235#false} is VALID [2022-04-15 06:01:16,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {286#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {282#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:16,104 INFO L272 TraceCheckUtils]: 8: Hoare triple {290#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {286#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:16,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {290#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:01:16,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {294#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:16,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 268435441; {298#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:16,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-15 06:01:16,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 06:01:16,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 06:01:16,108 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 06:01:16,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-15 06:01:16,109 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 06:01:16,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355160467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:16,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:16,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 7] total 11 [2022-04-15 06:01:16,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:16,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [171066559] [2022-04-15 06:01:16,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [171066559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:16,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:16,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:01:16,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539008345] [2022-04-15 06:01:16,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:16,112 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 06:01:16,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:16,112 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 06:01:16,121 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 06:01:16,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:01:16,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:16,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:01:16,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:01:16,123 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 06:01:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:16,197 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 06:01:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:01:16,198 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 06:01:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:16,199 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 06:01:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 06:01:16,200 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 06:01:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 06:01:16,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-15 06:01:16,218 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 06:01:16,222 INFO L225 Difference]: With dead ends: 19 [2022-04-15 06:01:16,223 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 06:01:16,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:01:16,229 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 06:01:16,230 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 06:01:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 06:01:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 06:01:16,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:16,236 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 06:01:16,236 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 06:01:16,237 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 06:01:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:16,238 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 06:01:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 06:01:16,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:16,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:16,238 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 06:01:16,238 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 06:01:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:16,239 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 06:01:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 06:01:16,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:16,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:16,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:16,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:16,240 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 06:01:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 06:01:16,241 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 06:01:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:16,241 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 06:01:16,241 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 06:01:16,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 06:01:16,254 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 06:01:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 06:01:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:01:16,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:16,255 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:16,275 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 06:01:16,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 06:01:16,671 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 06:01:16,672 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:16,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-15 06:01:16,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:16,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1875739875] [2022-04-15 06:01:16,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:01:16,897 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1808202441, now seen corresponding path program 1 times [2022-04-15 06:01:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:16,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735780677] [2022-04-15 06:01:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:16,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:16,924 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:16,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072179441] [2022-04-15 06:01:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:16,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:16,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:16,952 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 06:01:17,006 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 06:01:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:17,063 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:17,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-15 06:01:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:17,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530121229] [2022-04-15 06:01:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:17,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:17,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-15 06:01:17,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 06:01:17,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-15 06:01:17,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:17,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-15 06:01:17,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 06:01:17,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-15 06:01:17,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret4 := main(); {417#true} is VALID [2022-04-15 06:01:17,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 268435441; {422#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:17,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {423#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:17,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {424#(and (<= (div main_~x~0 4294967296) 0) (<= 268435437 main_~x~0))} is VALID [2022-04-15 06:01:17,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#(and (<= (div main_~x~0 4294967296) 0) (<= 268435437 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {418#false} is VALID [2022-04-15 06:01:17,177 INFO L272 TraceCheckUtils]: 9: Hoare triple {418#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {418#false} is VALID [2022-04-15 06:01:17,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-15 06:01:17,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-15 06:01:17,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-15 06:01:17,178 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 06:01:17,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:17,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530121229] [2022-04-15 06:01:17,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530121229] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:17,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692123539] [2022-04-15 06:01:17,178 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:17,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:17,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:17,196 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 06:01:17,229 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 06:01:17,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:17,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:17,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:01:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:17,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:17,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-15 06:01:17,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-15 06:01:17,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 06:01:17,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-15 06:01:17,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret4 := main(); {417#true} is VALID [2022-04-15 06:01:17,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 268435441; {422#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:17,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {423#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:17,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {450#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:17,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {450#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !(~x~0 % 4294967296 > 1); {418#false} is VALID [2022-04-15 06:01:17,444 INFO L272 TraceCheckUtils]: 9: Hoare triple {418#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {418#false} is VALID [2022-04-15 06:01:17,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-15 06:01:17,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-15 06:01:17,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-15 06:01:17,445 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 06:01:17,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:17,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-15 06:01:17,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-15 06:01:17,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-15 06:01:17,525 INFO L272 TraceCheckUtils]: 9: Hoare triple {418#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {418#false} is VALID [2022-04-15 06:01:17,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {478#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {418#false} is VALID [2022-04-15 06:01:17,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {482#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {478#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:01:17,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {482#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:01:17,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 268435441; {486#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:17,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret4 := main(); {417#true} is VALID [2022-04-15 06:01:17,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-15 06:01:17,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-15 06:01:17,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {417#true} is VALID [2022-04-15 06:01:17,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-15 06:01:17,532 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 06:01:17,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692123539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:17,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:17,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 06:01:17,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:17,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1875739875] [2022-04-15 06:01:17,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1875739875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:17,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:17,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:01:17,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392228116] [2022-04-15 06:01:17,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:17,534 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 06:01:17,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:17,534 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 06:01:17,545 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 06:01:17,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:01:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:17,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:01:17,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:01:17,547 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 06:01:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:17,633 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 06:01:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:01:17,633 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 06:01:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:17,634 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 06:01:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 06:01:17,635 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 06:01:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 06:01:17,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-15 06:01:17,655 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 06:01:17,656 INFO L225 Difference]: With dead ends: 20 [2022-04-15 06:01:17,656 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 06:01:17,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:01:17,657 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:17,657 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:01:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 06:01:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 06:01:17,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:17,664 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 06:01:17,665 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 06:01:17,665 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 06:01:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:17,666 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 06:01:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 06:01:17,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:17,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:17,666 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 06:01:17,667 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 06:01:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:17,668 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 06:01:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 06:01:17,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:17,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:17,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:17,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:17,669 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 06:01:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 06:01:17,670 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 06:01:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:17,670 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 06:01:17,670 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 06:01:17,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 06:01:17,683 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 06:01:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 06:01:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:01:17,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:17,684 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:17,708 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 06:01:17,900 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 06:01:18,085 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 06:01:18,085 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:18,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-15 06:01:18,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:18,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [358465026] [2022-04-15 06:01:18,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:01:18,328 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:18,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1749097097, now seen corresponding path program 1 times [2022-04-15 06:01:18,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:18,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283829600] [2022-04-15 06:01:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:18,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:18,341 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:18,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1271498236] [2022-04-15 06:01:18,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:18,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:18,357 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 06:01:18,394 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 06:01:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:18,403 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:18,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-15 06:01:18,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:18,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639415947] [2022-04-15 06:01:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:18,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-15 06:01:18,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-15 06:01:18,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-15 06:01:18,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:18,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-15 06:01:18,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-15 06:01:18,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-15 06:01:18,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret4 := main(); {613#true} is VALID [2022-04-15 06:01:18,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#true} ~x~0 := 268435441; {618#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:18,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {619#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:18,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {620#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:18,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {620#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {621#(and (<= (div main_~x~0 4294967296) 0) (<= 268435435 main_~x~0))} is VALID [2022-04-15 06:01:18,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {621#(and (<= (div main_~x~0 4294967296) 0) (<= 268435435 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {614#false} is VALID [2022-04-15 06:01:18,554 INFO L272 TraceCheckUtils]: 10: Hoare triple {614#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {614#false} is VALID [2022-04-15 06:01:18,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2022-04-15 06:01:18,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2022-04-15 06:01:18,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-15 06:01:18,555 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 06:01:18,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:18,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639415947] [2022-04-15 06:01:18,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639415947] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:18,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291127493] [2022-04-15 06:01:18,555 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:18,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:18,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:18,557 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 06:01:18,592 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 06:01:18,620 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 06:01:18,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:18,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:01:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:18,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:18,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2022-04-15 06:01:18,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-15 06:01:18,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-15 06:01:18,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-15 06:01:18,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret4 := main(); {613#true} is VALID [2022-04-15 06:01:18,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#true} ~x~0 := 268435441; {618#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:18,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {619#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:18,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {620#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:18,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {620#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {650#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:18,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {650#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !(~x~0 % 4294967296 > 1); {614#false} is VALID [2022-04-15 06:01:18,761 INFO L272 TraceCheckUtils]: 10: Hoare triple {614#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {614#false} is VALID [2022-04-15 06:01:18,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2022-04-15 06:01:18,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2022-04-15 06:01:18,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-15 06:01:18,762 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 06:01:18,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:18,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-15 06:01:18,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {669#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {614#false} is VALID [2022-04-15 06:01:18,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {673#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {669#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:18,990 INFO L272 TraceCheckUtils]: 10: Hoare triple {677#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {673#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:18,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {677#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:01:18,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {681#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:18,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {685#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:18,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {689#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:18,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#true} ~x~0 := 268435441; {693#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:18,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret4 := main(); {613#true} is VALID [2022-04-15 06:01:18,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-15 06:01:18,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-15 06:01:18,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-15 06:01:18,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2022-04-15 06:01:18,994 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 06:01:18,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291127493] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:18,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:18,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 15 [2022-04-15 06:01:18,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:18,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [358465026] [2022-04-15 06:01:18,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [358465026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:18,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:18,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:01:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905947983] [2022-04-15 06:01:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:18,995 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 06:01:18,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:18,996 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 06:01:19,005 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 06:01:19,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:01:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:01:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:01:19,006 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 06:01:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:19,145 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 06:01:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:01:19,146 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 06:01:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:19,146 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 06:01:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 06:01:19,147 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 06:01:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 06:01:19,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-15 06:01:19,168 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 06:01:19,169 INFO L225 Difference]: With dead ends: 21 [2022-04-15 06:01:19,169 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:01:19,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:01:19,170 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:19,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:01:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:01:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 06:01:19,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:19,180 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 06:01:19,180 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 06:01:19,180 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 06:01:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:19,181 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 06:01:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 06:01:19,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:19,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:19,182 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 06:01:19,182 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 06:01:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:19,183 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 06:01:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 06:01:19,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:19,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:19,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:19,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:19,183 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 06:01:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 06:01:19,184 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 06:01:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:19,184 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 06:01:19,184 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 06:01:19,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 06:01:19,200 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 06:01:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 06:01:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:01:19,200 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:19,201 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:19,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 06:01:19,438 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 06:01:19,615 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 06:01:19,616 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:19,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:19,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-15 06:01:19,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:19,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [527070643] [2022-04-15 06:01:19,785 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:19,787 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:19,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1689991753, now seen corresponding path program 1 times [2022-04-15 06:01:19,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:19,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970530447] [2022-04-15 06:01:19,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:19,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:19,796 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_4.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:19,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1162707922] [2022-04-15 06:01:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:19,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:19,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:19,806 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 06:01:19,807 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 06:01:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:19,832 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:19,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-15 06:01:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:19,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145446985] [2022-04-15 06:01:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:19,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:19,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {828#true} is VALID [2022-04-15 06:01:19,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-15 06:01:19,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-15 06:01:19,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {828#true} call ULTIMATE.init(); {838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:19,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {828#true} is VALID [2022-04-15 06:01:19,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-15 06:01:19,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-15 06:01:19,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {828#true} call #t~ret4 := main(); {828#true} is VALID [2022-04-15 06:01:19,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {828#true} ~x~0 := 268435441; {833#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:19,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {834#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:19,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {834#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {835#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:19,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {836#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:19,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {836#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {837#(and (<= (div main_~x~0 4294967296) 0) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:19,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {837#(and (<= (div main_~x~0 4294967296) 0) (<= 268435433 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {829#false} is VALID [2022-04-15 06:01:19,961 INFO L272 TraceCheckUtils]: 11: Hoare triple {829#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {829#false} is VALID [2022-04-15 06:01:19,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {829#false} ~cond := #in~cond; {829#false} is VALID [2022-04-15 06:01:19,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {829#false} assume 0 == ~cond; {829#false} is VALID [2022-04-15 06:01:19,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#false} assume !false; {829#false} is VALID [2022-04-15 06:01:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:01:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:19,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145446985] [2022-04-15 06:01:19,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145446985] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:19,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278550143] [2022-04-15 06:01:19,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:19,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:19,963 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 06:01:19,965 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 06:01:19,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:19,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:19,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 06:01:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:20,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:20,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {828#true} call ULTIMATE.init(); {828#true} is VALID [2022-04-15 06:01:20,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {828#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {828#true} is VALID [2022-04-15 06:01:20,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-15 06:01:20,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-15 06:01:20,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {828#true} call #t~ret4 := main(); {828#true} is VALID [2022-04-15 06:01:20,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {828#true} ~x~0 := 268435441; {833#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:20,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {834#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:20,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {834#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {835#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:20,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {836#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:20,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {836#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {869#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:20,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {869#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {829#false} is VALID [2022-04-15 06:01:20,100 INFO L272 TraceCheckUtils]: 11: Hoare triple {829#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {829#false} is VALID [2022-04-15 06:01:20,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {829#false} ~cond := #in~cond; {829#false} is VALID [2022-04-15 06:01:20,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {829#false} assume 0 == ~cond; {829#false} is VALID [2022-04-15 06:01:20,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#false} assume !false; {829#false} is VALID [2022-04-15 06:01:20,100 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 06:01:20,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:20,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#false} assume !false; {829#false} is VALID [2022-04-15 06:01:20,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {888#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {829#false} is VALID [2022-04-15 06:01:20,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {892#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {888#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:20,325 INFO L272 TraceCheckUtils]: 11: Hoare triple {896#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {892#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:20,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {900#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {896#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:01:20,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {904#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {900#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:20,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {908#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {904#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:20,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {908#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:20,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {912#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:20,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {828#true} ~x~0 := 268435441; {916#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:20,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {828#true} call #t~ret4 := main(); {828#true} is VALID [2022-04-15 06:01:20,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-15 06:01:20,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-15 06:01:20,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {828#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {828#true} is VALID [2022-04-15 06:01:20,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {828#true} call ULTIMATE.init(); {828#true} is VALID [2022-04-15 06:01:20,336 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 06:01:20,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278550143] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:20,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:20,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 17 [2022-04-15 06:01:20,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:20,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [527070643] [2022-04-15 06:01:20,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [527070643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:20,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:20,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:01:20,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379092960] [2022-04-15 06:01:20,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:20,338 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 06:01:20,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:20,338 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 06:01:20,351 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 06:01:20,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:01:20,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:20,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:01:20,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:01:20,352 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 06:01:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:20,490 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 06:01:20,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:01:20,490 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 06:01:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:20,491 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 06:01:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 06:01:20,492 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 06:01:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 06:01:20,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 06:01:20,517 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 06:01:20,518 INFO L225 Difference]: With dead ends: 22 [2022-04-15 06:01:20,518 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:01:20,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:01:20,519 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:20,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:01:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:01:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:01:20,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:20,529 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 06:01:20,529 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 06:01:20,529 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 06:01:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:20,530 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 06:01:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 06:01:20,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:20,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:20,531 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 06:01:20,531 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 06:01:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:20,531 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 06:01:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 06:01:20,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:20,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:20,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:20,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:20,532 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 06:01:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 06:01:20,533 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-15 06:01:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:20,533 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 06:01:20,533 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 06:01:20,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 06:01:20,557 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 06:01:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 06:01:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:01:20,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:20,558 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:20,598 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 06:01:20,767 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 06:01:20,959 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 06:01:20,959 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-15 06:01:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:20,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [10328960] [2022-04-15 06:01:21,137 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:21,139 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1630886409, now seen corresponding path program 1 times [2022-04-15 06:01:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:21,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516665447] [2022-04-15 06:01:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:21,157 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:21,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [212513614] [2022-04-15 06:01:21,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:21,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:21,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:21,179 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 06:01:21,180 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 06:01:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:21,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:21,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-15 06:01:21,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:21,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9625870] [2022-04-15 06:01:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:21,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:21,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:21,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {1070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1059#true} is VALID [2022-04-15 06:01:21,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-15 06:01:21,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-15 06:01:21,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:21,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1059#true} is VALID [2022-04-15 06:01:21,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-15 06:01:21,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-15 06:01:21,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret4 := main(); {1059#true} is VALID [2022-04-15 06:01:21,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {1059#true} ~x~0 := 268435441; {1064#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:21,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {1064#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1065#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:21,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1065#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1066#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:21,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1067#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:21,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1068#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:21,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {1068#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1069#(and (<= 268435431 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:01:21,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {1069#(and (<= 268435431 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {1060#false} is VALID [2022-04-15 06:01:21,349 INFO L272 TraceCheckUtils]: 12: Hoare triple {1060#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1060#false} is VALID [2022-04-15 06:01:21,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2022-04-15 06:01:21,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2022-04-15 06:01:21,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2022-04-15 06:01:21,350 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 06:01:21,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:21,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9625870] [2022-04-15 06:01:21,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9625870] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:21,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820826973] [2022-04-15 06:01:21,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:21,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:21,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:21,364 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 06:01:21,383 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 06:01:21,408 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:21,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:21,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 06:01:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:21,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:21,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2022-04-15 06:01:21,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {1059#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1059#true} is VALID [2022-04-15 06:01:21,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-15 06:01:21,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-15 06:01:21,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret4 := main(); {1059#true} is VALID [2022-04-15 06:01:21,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {1059#true} ~x~0 := 268435441; {1064#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:21,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {1064#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1065#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:21,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {1065#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1066#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:21,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1067#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:21,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1068#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:21,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {1068#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1104#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:21,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {1104#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !(~x~0 % 4294967296 > 1); {1060#false} is VALID [2022-04-15 06:01:21,613 INFO L272 TraceCheckUtils]: 12: Hoare triple {1060#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1060#false} is VALID [2022-04-15 06:01:21,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2022-04-15 06:01:21,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2022-04-15 06:01:21,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2022-04-15 06:01:21,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 06:01:21,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:21,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2022-04-15 06:01:21,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2022-04-15 06:01:21,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2022-04-15 06:01:21,759 INFO L272 TraceCheckUtils]: 12: Hoare triple {1060#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1060#false} is VALID [2022-04-15 06:01:21,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {1132#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {1060#false} is VALID [2022-04-15 06:01:21,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {1136#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1132#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:01:21,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {1140#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1136#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:01:21,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {1144#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1140#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:21,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {1148#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1144#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:21,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {1152#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1148#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:21,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {1059#true} ~x~0 := 268435441; {1152#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:01:21,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret4 := main(); {1059#true} is VALID [2022-04-15 06:01:21,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-15 06:01:21,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-15 06:01:21,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {1059#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1059#true} is VALID [2022-04-15 06:01:21,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2022-04-15 06:01:21,772 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 06:01:21,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820826973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:21,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:21,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 06:01:21,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:21,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [10328960] [2022-04-15 06:01:21,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [10328960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:21,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:21,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:01:21,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165139061] [2022-04-15 06:01:21,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:21,773 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 06:01:21,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:21,773 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 06:01:21,784 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 06:01:21,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:01:21,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:21,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:01:21,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:01:21,785 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 06:01:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:22,017 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 06:01:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:01:22,018 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 06:01:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:22,018 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 06:01:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 06:01:22,020 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 06:01:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 06:01:22,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-15 06:01:22,042 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 06:01:22,043 INFO L225 Difference]: With dead ends: 23 [2022-04-15 06:01:22,043 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 06:01:22,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:01:22,044 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:22,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:01:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 06:01:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 06:01:22,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:22,054 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 06:01:22,054 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 06:01:22,054 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 06:01:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:22,055 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 06:01:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 06:01:22,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:22,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:22,055 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 06:01:22,055 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 06:01:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:22,056 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 06:01:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 06:01:22,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:22,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:22,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:22,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:22,056 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 06:01:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 06:01:22,057 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 06:01:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:22,057 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 06:01:22,057 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 06:01:22,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 06:01:22,070 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 06:01:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 06:01:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:01:22,071 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:22,071 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:22,090 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 06:01:22,297 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 06:01:22,490 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 06:01:22,491 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:22,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-15 06:01:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:22,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389769687] [2022-04-15 06:01:22,668 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:22,670 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1571781065, now seen corresponding path program 1 times [2022-04-15 06:01:22,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:22,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555216153] [2022-04-15 06:01:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:22,685 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:22,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672147852] [2022-04-15 06:01:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:22,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:22,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:22,704 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 06:01:22,744 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 06:01:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:22,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:22,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-15 06:01:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:22,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139677805] [2022-04-15 06:01:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:22,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:22,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:22,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {1315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1303#true} is VALID [2022-04-15 06:01:22,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-15 06:01:22,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-15 06:01:22,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {1303#true} call ULTIMATE.init(); {1315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:22,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1303#true} is VALID [2022-04-15 06:01:22,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-15 06:01:22,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-15 06:01:22,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {1303#true} call #t~ret4 := main(); {1303#true} is VALID [2022-04-15 06:01:22,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {1303#true} ~x~0 := 268435441; {1308#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:22,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1309#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:22,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {1309#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1310#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:22,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1311#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:22,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {1311#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1312#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:22,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1313#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:22,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1314#(and (<= (div main_~x~0 4294967296) 0) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:22,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(and (<= (div main_~x~0 4294967296) 0) (<= 268435429 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {1304#false} is VALID [2022-04-15 06:01:22,923 INFO L272 TraceCheckUtils]: 13: Hoare triple {1304#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1304#false} is VALID [2022-04-15 06:01:22,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {1304#false} ~cond := #in~cond; {1304#false} is VALID [2022-04-15 06:01:22,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {1304#false} assume 0 == ~cond; {1304#false} is VALID [2022-04-15 06:01:22,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {1304#false} assume !false; {1304#false} is VALID [2022-04-15 06:01:22,923 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 06:01:22,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:22,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139677805] [2022-04-15 06:01:22,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139677805] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:22,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174941824] [2022-04-15 06:01:22,924 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:22,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:22,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:22,936 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 06:01:22,963 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 06:01:23,001 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 06:01:23,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:23,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:01:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:23,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:23,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {1303#true} call ULTIMATE.init(); {1303#true} is VALID [2022-04-15 06:01:23,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1303#true} is VALID [2022-04-15 06:01:23,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-15 06:01:23,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-15 06:01:23,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {1303#true} call #t~ret4 := main(); {1303#true} is VALID [2022-04-15 06:01:23,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {1303#true} ~x~0 := 268435441; {1308#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:23,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1309#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:23,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {1309#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1310#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:23,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1311#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:23,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {1311#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1312#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:23,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1313#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:23,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1352#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:23,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {1352#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {1304#false} is VALID [2022-04-15 06:01:23,121 INFO L272 TraceCheckUtils]: 13: Hoare triple {1304#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1304#false} is VALID [2022-04-15 06:01:23,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {1304#false} ~cond := #in~cond; {1304#false} is VALID [2022-04-15 06:01:23,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {1304#false} assume 0 == ~cond; {1304#false} is VALID [2022-04-15 06:01:23,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {1304#false} assume !false; {1304#false} is VALID [2022-04-15 06:01:23,122 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 06:01:23,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:23,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {1304#false} assume !false; {1304#false} is VALID [2022-04-15 06:01:23,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {1371#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1304#false} is VALID [2022-04-15 06:01:23,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1371#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:23,504 INFO L272 TraceCheckUtils]: 13: Hoare triple {1379#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1375#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:23,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {1383#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {1379#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:01:23,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {1387#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1383#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:23,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {1391#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1387#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:23,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {1395#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1391#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:23,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {1399#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1395#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:23,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {1403#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1399#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:23,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {1407#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1403#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:23,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {1303#true} ~x~0 := 268435441; {1407#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:23,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {1303#true} call #t~ret4 := main(); {1303#true} is VALID [2022-04-15 06:01:23,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-15 06:01:23,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-15 06:01:23,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1303#true} is VALID [2022-04-15 06:01:23,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {1303#true} call ULTIMATE.init(); {1303#true} is VALID [2022-04-15 06:01:23,514 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 06:01:23,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174941824] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:23,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:23,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 12] total 21 [2022-04-15 06:01:23,514 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:23,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389769687] [2022-04-15 06:01:23,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389769687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:23,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:23,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:01:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285993837] [2022-04-15 06:01:23,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:23,515 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 06:01:23,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:23,515 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 06:01:23,531 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 06:01:23,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:01:23,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:23,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:01:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:01:23,532 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 06:01:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:23,809 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 06:01:23,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:01:23,809 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 06:01:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:23,810 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 06:01:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 06:01:23,811 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 06:01:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 06:01:23,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-15 06:01:23,838 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 06:01:23,838 INFO L225 Difference]: With dead ends: 24 [2022-04-15 06:01:23,838 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 06:01:23,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:01:23,840 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:23,840 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:01:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 06:01:23,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 06:01:23,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:23,854 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 06:01:23,854 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 06:01:23,855 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 06:01:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:23,855 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 06:01:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 06:01:23,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:23,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:23,856 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 06:01:23,856 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 06:01:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:23,856 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 06:01:23,857 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 06:01:23,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:23,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:23,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:23,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:23,857 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 06:01:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 06:01:23,861 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-15 06:01:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:23,861 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 06:01:23,861 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 06:01:23,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 06:01:23,877 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 06:01:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 06:01:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:01:23,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:23,877 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:23,884 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 06:01:24,086 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 06:01:24,281 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 06:01:24,282 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:24,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:24,282 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 13 times [2022-04-15 06:01:24,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:24,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1795583296] [2022-04-15 06:01:24,481 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:24,484 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1512675721, now seen corresponding path program 1 times [2022-04-15 06:01:24,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:24,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409686919] [2022-04-15 06:01:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:24,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:24,495 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:24,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [551436308] [2022-04-15 06:01:24,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:24,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:24,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:24,503 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 06:01:24,504 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 06:01:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:24,530 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:24,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 14 times [2022-04-15 06:01:24,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:24,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444126074] [2022-04-15 06:01:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:24,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {1579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-15 06:01:24,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 06:01:24,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-15 06:01:24,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:24,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {1579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-15 06:01:24,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 06:01:24,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-15 06:01:24,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret4 := main(); {1566#true} is VALID [2022-04-15 06:01:24,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} ~x~0 := 268435441; {1571#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:24,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {1571#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1572#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:24,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1573#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:24,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {1573#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1574#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:24,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1575#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:24,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {1575#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1576#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:24,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1577#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:24,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {1577#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1578#(and (<= (div main_~x~0 4294967296) 0) (<= 268435427 main_~x~0))} is VALID [2022-04-15 06:01:24,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {1578#(and (<= (div main_~x~0 4294967296) 0) (<= 268435427 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {1567#false} is VALID [2022-04-15 06:01:24,704 INFO L272 TraceCheckUtils]: 14: Hoare triple {1567#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1567#false} is VALID [2022-04-15 06:01:24,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-15 06:01:24,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-15 06:01:24,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-15 06:01:24,704 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 06:01:24,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:24,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444126074] [2022-04-15 06:01:24,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444126074] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:24,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663364132] [2022-04-15 06:01:24,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:24,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:24,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:24,706 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 06:01:24,706 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 06:01:24,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:24,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:24,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:01:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:24,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:24,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-15 06:01:24,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-15 06:01:24,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 06:01:24,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-15 06:01:24,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret4 := main(); {1566#true} is VALID [2022-04-15 06:01:24,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} ~x~0 := 268435441; {1571#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:24,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {1571#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1572#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:24,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1573#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:24,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {1573#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1574#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:24,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1575#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:24,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {1575#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1576#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:24,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1577#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:24,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {1577#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1619#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:24,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {1619#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !(~x~0 % 4294967296 > 1); {1567#false} is VALID [2022-04-15 06:01:24,863 INFO L272 TraceCheckUtils]: 14: Hoare triple {1567#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1567#false} is VALID [2022-04-15 06:01:24,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-15 06:01:24,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-15 06:01:24,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-15 06:01:24,863 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 06:01:24,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:25,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-15 06:01:25,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {1638#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1567#false} is VALID [2022-04-15 06:01:25,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {1642#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1638#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:25,256 INFO L272 TraceCheckUtils]: 14: Hoare triple {1646#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1642#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:25,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {1650#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {1646#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:01:25,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1650#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:25,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {1658#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1654#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:25,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {1662#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1658#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:25,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {1666#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1662#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:25,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {1670#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1666#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:25,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {1674#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1670#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:25,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {1678#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1674#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:25,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} ~x~0 := 268435441; {1678#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:25,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret4 := main(); {1566#true} is VALID [2022-04-15 06:01:25,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-15 06:01:25,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 06:01:25,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-15 06:01:25,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-15 06:01:25,283 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 06:01:25,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663364132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:25,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:25,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2022-04-15 06:01:25,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:25,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1795583296] [2022-04-15 06:01:25,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1795583296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:25,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:25,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:01:25,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540577358] [2022-04-15 06:01:25,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:25,285 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 06:01:25,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:25,286 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 06:01:25,298 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 06:01:25,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:01:25,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:25,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:01:25,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:01:25,313 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 06:01:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:25,622 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 06:01:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:01:25,622 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 06:01:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:25,622 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 06:01:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 06:01:25,623 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 06:01:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 06:01:25,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2022-04-15 06:01:25,646 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:01:25,647 INFO L225 Difference]: With dead ends: 25 [2022-04-15 06:01:25,647 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 06:01:25,648 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:01:25,648 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:25,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:01:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 06:01:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 06:01:25,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:25,660 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 06:01:25,660 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 06:01:25,660 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 06:01:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:25,661 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 06:01:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 06:01:25,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:25,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:25,662 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 06:01:25,662 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 06:01:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:25,662 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 06:01:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 06:01:25,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:25,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:25,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:25,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:25,663 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 06:01:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 06:01:25,663 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-15 06:01:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:25,663 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 06:01:25,663 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 06:01:25,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-15 06:01:25,679 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 06:01:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 06:01:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:01:25,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:25,679 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:25,700 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 06:01:25,903 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 06:01:26,080 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 06:01:26,080 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 15 times [2022-04-15 06:01:26,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:26,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148555591] [2022-04-15 06:01:26,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 06:01:26,262 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1453570377, now seen corresponding path program 1 times [2022-04-15 06:01:26,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:26,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237208652] [2022-04-15 06:01:26,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:26,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:26,271 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_8.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:26,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [700464591] [2022-04-15 06:01:26,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:26,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:26,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:26,296 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 06:01:26,337 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 06:01:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:26,387 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:26,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:26,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 16 times [2022-04-15 06:01:26,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:26,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179026257] [2022-04-15 06:01:26,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:26,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:26,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {1859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1845#true} is VALID [2022-04-15 06:01:26,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-15 06:01:26,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-15 06:01:26,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {1845#true} call ULTIMATE.init(); {1859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:26,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {1859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1845#true} is VALID [2022-04-15 06:01:26,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-15 06:01:26,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-15 06:01:26,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {1845#true} call #t~ret4 := main(); {1845#true} is VALID [2022-04-15 06:01:26,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {1845#true} ~x~0 := 268435441; {1850#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:26,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {1850#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1851#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:26,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {1851#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1852#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:26,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {1852#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1853#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:26,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {1853#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1854#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:26,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {1854#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1855#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:26,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {1855#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1856#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:26,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {1856#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1857#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:26,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {1857#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1858#(and (<= (div main_~x~0 4294967296) 0) (<= 268435425 main_~x~0))} is VALID [2022-04-15 06:01:26,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {1858#(and (<= (div main_~x~0 4294967296) 0) (<= 268435425 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {1846#false} is VALID [2022-04-15 06:01:26,592 INFO L272 TraceCheckUtils]: 15: Hoare triple {1846#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1846#false} is VALID [2022-04-15 06:01:26,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#false} ~cond := #in~cond; {1846#false} is VALID [2022-04-15 06:01:26,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#false} assume 0 == ~cond; {1846#false} is VALID [2022-04-15 06:01:26,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#false} assume !false; {1846#false} is VALID [2022-04-15 06:01:26,592 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 06:01:26,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:26,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179026257] [2022-04-15 06:01:26,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179026257] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:26,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104579230] [2022-04-15 06:01:26,593 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:26,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:26,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:26,594 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 06:01:26,595 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 06:01:26,620 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:26,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:26,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 06:01:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:26,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:26,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {1845#true} call ULTIMATE.init(); {1845#true} is VALID [2022-04-15 06:01:26,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {1845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1845#true} is VALID [2022-04-15 06:01:26,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-15 06:01:26,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-15 06:01:26,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {1845#true} call #t~ret4 := main(); {1845#true} is VALID [2022-04-15 06:01:26,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {1845#true} ~x~0 := 268435441; {1850#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:26,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {1850#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1851#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:26,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {1851#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1852#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:26,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {1852#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1853#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:26,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {1853#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1854#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:26,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {1854#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1855#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:26,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {1855#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1856#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:26,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {1856#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1857#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:26,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {1857#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1902#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:26,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {1902#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !(~x~0 % 4294967296 > 1); {1846#false} is VALID [2022-04-15 06:01:26,873 INFO L272 TraceCheckUtils]: 15: Hoare triple {1846#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1846#false} is VALID [2022-04-15 06:01:26,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#false} ~cond := #in~cond; {1846#false} is VALID [2022-04-15 06:01:26,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#false} assume 0 == ~cond; {1846#false} is VALID [2022-04-15 06:01:26,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#false} assume !false; {1846#false} is VALID [2022-04-15 06:01:26,874 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 06:01:26,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:27,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#false} assume !false; {1846#false} is VALID [2022-04-15 06:01:27,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#false} assume 0 == ~cond; {1846#false} is VALID [2022-04-15 06:01:27,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#false} ~cond := #in~cond; {1846#false} is VALID [2022-04-15 06:01:27,168 INFO L272 TraceCheckUtils]: 15: Hoare triple {1846#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1846#false} is VALID [2022-04-15 06:01:27,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {1930#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {1846#false} is VALID [2022-04-15 06:01:27,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {1934#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1930#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:01:27,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {1938#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1934#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:01:27,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {1942#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1938#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:27,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {1946#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1942#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:27,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {1950#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1946#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:27,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {1954#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1950#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:01:27,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {1958#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1954#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:01:27,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {1962#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1958#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:27,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {1845#true} ~x~0 := 268435441; {1962#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:01:27,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {1845#true} call #t~ret4 := main(); {1845#true} is VALID [2022-04-15 06:01:27,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-15 06:01:27,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-15 06:01:27,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {1845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1845#true} is VALID [2022-04-15 06:01:27,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {1845#true} call ULTIMATE.init(); {1845#true} is VALID [2022-04-15 06:01:27,176 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 06:01:27,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104579230] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:27,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:27,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 06:01:27,177 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:27,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148555591] [2022-04-15 06:01:27,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148555591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:27,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:27,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:01:27,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280219424] [2022-04-15 06:01:27,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:27,178 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 06:01:27,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:27,178 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 06:01:27,191 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 06:01:27,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:01:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:01:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:01:27,192 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 06:01:27,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:27,524 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 06:01:27,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:01:27,524 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 06:01:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:27,524 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 06:01:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 06:01:27,525 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 06:01:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 06:01:27,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-15 06:01:27,545 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:01:27,546 INFO L225 Difference]: With dead ends: 26 [2022-04-15 06:01:27,546 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 06:01:27,546 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=657, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:01:27,547 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:27,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:01:27,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 06:01:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 06:01:27,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:27,571 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 06:01:27,571 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 06:01:27,571 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 06:01:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:27,572 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 06:01:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 06:01:27,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:27,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:27,572 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 06:01:27,573 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 06:01:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:27,573 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 06:01:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 06:01:27,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:27,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:27,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:27,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:27,574 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 06:01:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 06:01:27,574 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-15 06:01:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:27,574 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 06:01:27,574 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 06:01:27,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 06:01:27,590 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 06:01:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 06:01:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:01:27,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:27,591 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:27,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 06:01:27,812 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 06:01:28,008 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 06:01:28,008 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:28,009 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 17 times [2022-04-15 06:01:28,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:28,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1817682159] [2022-04-15 06:01:28,188 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,189 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:28,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1394465033, now seen corresponding path program 1 times [2022-04-15 06:01:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:28,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437353050] [2022-04-15 06:01:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:28,199 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:28,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [176144365] [2022-04-15 06:01:28,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:28,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:28,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:28,211 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 06:01:28,233 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 06:01:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:28,257 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:28,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 18 times [2022-04-15 06:01:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:28,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210637949] [2022-04-15 06:01:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:28,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:28,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {2152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2137#true} is VALID [2022-04-15 06:01:28,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-15 06:01:28,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-15 06:01:28,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {2137#true} call ULTIMATE.init(); {2152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:28,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {2152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2137#true} is VALID [2022-04-15 06:01:28,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-15 06:01:28,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-15 06:01:28,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#true} call #t~ret4 := main(); {2137#true} is VALID [2022-04-15 06:01:28,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#true} ~x~0 := 268435441; {2142#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:28,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {2142#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2143#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:28,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {2143#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2144#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:28,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {2144#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2145#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:28,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {2145#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2146#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:28,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {2146#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2147#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:28,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {2147#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2148#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:28,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {2148#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2149#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:28,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {2149#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2150#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:28,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {2150#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2151#(and (<= (div main_~x~0 4294967296) 0) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:28,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {2151#(and (<= (div main_~x~0 4294967296) 0) (<= 268435423 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {2138#false} is VALID [2022-04-15 06:01:28,416 INFO L272 TraceCheckUtils]: 16: Hoare triple {2138#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2138#false} is VALID [2022-04-15 06:01:28,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {2138#false} ~cond := #in~cond; {2138#false} is VALID [2022-04-15 06:01:28,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {2138#false} assume 0 == ~cond; {2138#false} is VALID [2022-04-15 06:01:28,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#false} assume !false; {2138#false} is VALID [2022-04-15 06:01:28,416 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 06:01:28,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:28,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210637949] [2022-04-15 06:01:28,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210637949] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:28,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900260851] [2022-04-15 06:01:28,416 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:28,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:28,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:28,417 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 06:01:28,419 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 06:01:28,470 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 06:01:28,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:28,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:01:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:28,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:28,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {2137#true} call ULTIMATE.init(); {2137#true} is VALID [2022-04-15 06:01:28,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {2137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2137#true} is VALID [2022-04-15 06:01:28,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-15 06:01:28,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-15 06:01:28,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#true} call #t~ret4 := main(); {2137#true} is VALID [2022-04-15 06:01:28,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#true} ~x~0 := 268435441; {2142#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:28,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {2142#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2143#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:28,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {2143#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2144#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:28,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {2144#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2145#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:28,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {2145#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2146#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:28,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {2146#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2147#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:28,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {2147#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2148#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:28,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {2148#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2149#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:28,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {2149#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2150#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:28,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {2150#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2198#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:28,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {2198#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {2138#false} is VALID [2022-04-15 06:01:28,611 INFO L272 TraceCheckUtils]: 16: Hoare triple {2138#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2138#false} is VALID [2022-04-15 06:01:28,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {2138#false} ~cond := #in~cond; {2138#false} is VALID [2022-04-15 06:01:28,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {2138#false} assume 0 == ~cond; {2138#false} is VALID [2022-04-15 06:01:28,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#false} assume !false; {2138#false} is VALID [2022-04-15 06:01:28,611 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 06:01:28,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:29,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#false} assume !false; {2138#false} is VALID [2022-04-15 06:01:29,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2138#false} is VALID [2022-04-15 06:01:29,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {2221#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2217#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:29,117 INFO L272 TraceCheckUtils]: 16: Hoare triple {2225#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2221#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:29,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {2229#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {2225#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:01:29,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {2233#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2229#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:29,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {2237#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2233#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:29,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {2241#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2237#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:29,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {2245#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2241#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:29,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {2249#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2245#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:29,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {2253#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2249#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:29,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {2257#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2253#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:29,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {2261#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2257#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:29,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {2265#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2261#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:29,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#true} ~x~0 := 268435441; {2265#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:29,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#true} call #t~ret4 := main(); {2137#true} is VALID [2022-04-15 06:01:29,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-15 06:01:29,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-15 06:01:29,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {2137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2137#true} is VALID [2022-04-15 06:01:29,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {2137#true} call ULTIMATE.init(); {2137#true} is VALID [2022-04-15 06:01:29,131 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 06:01:29,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900260851] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:29,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:29,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 27 [2022-04-15 06:01:29,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:29,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1817682159] [2022-04-15 06:01:29,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1817682159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:29,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:29,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:01:29,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130492627] [2022-04-15 06:01:29,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:29,132 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 06:01:29,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:29,132 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 06:01:29,166 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 06:01:29,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:01:29,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:29,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:01:29,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:01:29,167 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 06:01:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:29,525 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 06:01:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:01:29,526 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 06:01:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:29,526 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 06:01:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 06:01:29,527 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 06:01:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 06:01:29,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2022-04-15 06:01:29,551 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:01:29,551 INFO L225 Difference]: With dead ends: 27 [2022-04-15 06:01:29,551 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 06:01:29,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 06:01:29,553 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:29,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:01:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 06:01:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 06:01:29,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:29,570 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 06:01:29,570 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 06:01:29,570 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 06:01:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:29,571 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 06:01:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 06:01:29,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:29,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:29,572 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 06:01:29,572 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 06:01:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:29,572 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 06:01:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 06:01:29,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:29,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:29,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:29,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:29,573 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 06:01:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-15 06:01:29,573 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-15 06:01:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:29,573 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-15 06:01:29,573 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 06:01:29,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-15 06:01:29,611 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 06:01:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 06:01:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:01:29,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:29,612 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:29,619 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 06:01:29,840 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 06:01:30,017 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 06:01:30,017 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 19 times [2022-04-15 06:01:30,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:30,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [216472393] [2022-04-15 06:01:30,231 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:30,232 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:30,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1335359689, now seen corresponding path program 1 times [2022-04-15 06:01:30,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:30,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879827239] [2022-04-15 06:01:30,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:30,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:30,256 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:30,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576143781] [2022-04-15 06:01:30,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:30,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:30,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:30,280 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 06:01:30,297 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 06:01:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:30,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:30,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:30,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 20 times [2022-04-15 06:01:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:30,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227029948] [2022-04-15 06:01:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:30,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {2464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2448#true} is VALID [2022-04-15 06:01:30,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-15 06:01:30,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-15 06:01:30,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:30,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {2464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2448#true} is VALID [2022-04-15 06:01:30,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-15 06:01:30,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-15 06:01:30,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret4 := main(); {2448#true} is VALID [2022-04-15 06:01:30,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} ~x~0 := 268435441; {2453#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:30,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {2453#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2454#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:30,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {2454#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2455#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:30,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {2455#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2456#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:30,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2457#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:30,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {2457#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2458#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:30,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {2458#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2459#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:30,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {2459#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2460#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:30,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {2460#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2461#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:30,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {2461#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2462#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:30,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {2462#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2463#(and (<= 268435421 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:01:30,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {2463#(and (<= 268435421 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {2449#false} is VALID [2022-04-15 06:01:30,492 INFO L272 TraceCheckUtils]: 17: Hoare triple {2449#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2449#false} is VALID [2022-04-15 06:01:30,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {2449#false} ~cond := #in~cond; {2449#false} is VALID [2022-04-15 06:01:30,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {2449#false} assume 0 == ~cond; {2449#false} is VALID [2022-04-15 06:01:30,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-15 06:01:30,492 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 06:01:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:30,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227029948] [2022-04-15 06:01:30,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227029948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:30,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610459524] [2022-04-15 06:01:30,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:30,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:30,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:30,493 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 06:01:30,526 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 06:01:30,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:30,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:30,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 06:01:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:30,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:30,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-15 06:01:30,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2448#true} is VALID [2022-04-15 06:01:30,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-15 06:01:30,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-15 06:01:30,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret4 := main(); {2448#true} is VALID [2022-04-15 06:01:30,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} ~x~0 := 268435441; {2453#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:30,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {2453#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2454#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:30,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {2454#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2455#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:30,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {2455#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2456#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:30,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2457#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:30,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {2457#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2458#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:30,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {2458#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2459#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:30,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {2459#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2460#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:30,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {2460#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2461#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:30,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {2461#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2462#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:30,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {2462#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2513#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:30,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {2513#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !(~x~0 % 4294967296 > 1); {2449#false} is VALID [2022-04-15 06:01:30,692 INFO L272 TraceCheckUtils]: 17: Hoare triple {2449#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2449#false} is VALID [2022-04-15 06:01:30,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {2449#false} ~cond := #in~cond; {2449#false} is VALID [2022-04-15 06:01:30,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {2449#false} assume 0 == ~cond; {2449#false} is VALID [2022-04-15 06:01:30,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-15 06:01:30,693 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 06:01:30,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:31,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-15 06:01:31,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {2532#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2449#false} is VALID [2022-04-15 06:01:31,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {2536#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2532#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:31,172 INFO L272 TraceCheckUtils]: 17: Hoare triple {2540#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2536#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:31,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {2544#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {2540#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:01:31,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2544#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:31,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {2552#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2548#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:31,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {2556#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2552#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:31,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {2560#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2556#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:31,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {2564#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2560#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:31,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {2568#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2564#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:31,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2568#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:31,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {2576#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2572#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:31,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {2580#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2576#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:31,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {2584#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2580#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:31,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {2448#true} ~x~0 := 268435441; {2584#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:31,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret4 := main(); {2448#true} is VALID [2022-04-15 06:01:31,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-15 06:01:31,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-15 06:01:31,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2448#true} is VALID [2022-04-15 06:01:31,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-15 06:01:31,186 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 06:01:31,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610459524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:31,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:31,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 29 [2022-04-15 06:01:31,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:31,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [216472393] [2022-04-15 06:01:31,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [216472393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:31,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:31,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:01:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539825984] [2022-04-15 06:01:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:31,187 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 06:01:31,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:31,188 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 06:01:31,208 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 06:01:31,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:01:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:31,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:01:31,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:01:31,209 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 06:01:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:31,570 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 06:01:31,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:01:31,570 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 06:01:31,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:31,570 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 06:01:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 06:01:31,571 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 06:01:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 06:01:31,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-15 06:01:31,605 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:01:31,606 INFO L225 Difference]: With dead ends: 28 [2022-04-15 06:01:31,606 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:01:31,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1166, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:01:31,606 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 06:01:31,607 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 06:01:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:01:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 06:01:31,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:31,624 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 06:01:31,624 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 06:01:31,624 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 06:01:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:31,624 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 06:01:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 06:01:31,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:31,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:31,625 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 06:01:31,625 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 06:01:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:31,625 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 06:01:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 06:01:31,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:31,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:31,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:31,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:31,626 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 06:01:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 06:01:31,626 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-15 06:01:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:31,626 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 06:01:31,626 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 06:01:31,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 06:01:31,644 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 06:01:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 06:01:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:01:31,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:31,644 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:31,662 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 06:01:31,848 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 06:01:32,045 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 06:01:32,045 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 21 times [2022-04-15 06:01:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:32,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1135855073] [2022-04-15 06:01:32,202 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:32,204 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:32,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1276254345, now seen corresponding path program 1 times [2022-04-15 06:01:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:32,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405987927] [2022-04-15 06:01:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:32,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:32,211 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:32,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765875905] [2022-04-15 06:01:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:32,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:32,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:32,232 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 06:01:32,239 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 06:01:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:32,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:32,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 22 times [2022-04-15 06:01:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:32,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889084027] [2022-04-15 06:01:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:32,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {2792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2775#true} is VALID [2022-04-15 06:01:32,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-15 06:01:32,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-15 06:01:32,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:32,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2775#true} is VALID [2022-04-15 06:01:32,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-15 06:01:32,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-15 06:01:32,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret4 := main(); {2775#true} is VALID [2022-04-15 06:01:32,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {2775#true} ~x~0 := 268435441; {2780#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:32,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {2780#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:32,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {2781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:32,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {2782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:32,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {2783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2784#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:32,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {2784#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:32,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {2785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2786#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:32,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2787#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:32,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {2787#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2788#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:32,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {2788#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2789#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:32,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {2789#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2790#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:32,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {2790#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2791#(and (<= 268435419 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:01:32,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {2791#(and (<= 268435419 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {2776#false} is VALID [2022-04-15 06:01:32,497 INFO L272 TraceCheckUtils]: 18: Hoare triple {2776#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2776#false} is VALID [2022-04-15 06:01:32,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2022-04-15 06:01:32,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2022-04-15 06:01:32,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2022-04-15 06:01:32,498 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 06:01:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:32,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889084027] [2022-04-15 06:01:32,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889084027] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:32,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212014833] [2022-04-15 06:01:32,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:32,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:32,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:32,499 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 06:01:32,509 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 06:01:32,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:32,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:32,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 06:01:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:32,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:32,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2775#true} is VALID [2022-04-15 06:01:32,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2775#true} is VALID [2022-04-15 06:01:32,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-15 06:01:32,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-15 06:01:32,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret4 := main(); {2775#true} is VALID [2022-04-15 06:01:32,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {2775#true} ~x~0 := 268435441; {2780#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:32,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {2780#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:32,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {2781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:32,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {2782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:32,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {2783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2784#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:32,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {2784#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:32,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {2785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2786#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:32,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2787#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:32,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {2787#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2788#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:32,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {2788#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2789#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:32,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {2789#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2790#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:32,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {2790#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2844#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:32,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {2844#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !(~x~0 % 4294967296 > 1); {2776#false} is VALID [2022-04-15 06:01:32,806 INFO L272 TraceCheckUtils]: 18: Hoare triple {2776#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2776#false} is VALID [2022-04-15 06:01:32,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2022-04-15 06:01:32,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2022-04-15 06:01:32,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2022-04-15 06:01:32,806 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 06:01:32,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:33,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2022-04-15 06:01:33,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2022-04-15 06:01:33,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2022-04-15 06:01:33,130 INFO L272 TraceCheckUtils]: 18: Hoare triple {2776#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2776#false} is VALID [2022-04-15 06:01:33,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {2872#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {2776#false} is VALID [2022-04-15 06:01:33,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {2876#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2872#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:01:33,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {2880#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2876#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:01:33,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {2884#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2880#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:33,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {2888#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2884#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:33,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {2892#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2888#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:33,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {2896#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2892#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:01:33,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {2900#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2896#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:01:33,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {2904#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2900#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:33,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {2908#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2904#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:01:33,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {2912#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2908#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:01:33,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {2916#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2912#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:33,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {2775#true} ~x~0 := 268435441; {2916#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:33,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret4 := main(); {2775#true} is VALID [2022-04-15 06:01:33,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-15 06:01:33,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-15 06:01:33,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2775#true} is VALID [2022-04-15 06:01:33,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2775#true} is VALID [2022-04-15 06:01:33,144 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 06:01:33,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212014833] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:33,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:33,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 06:01:33,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:33,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1135855073] [2022-04-15 06:01:33,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1135855073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:33,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:33,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 06:01:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959848903] [2022-04-15 06:01:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:33,145 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 06:01:33,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:33,146 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 06:01:33,164 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 06:01:33,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 06:01:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 06:01:33,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:01:33,165 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 06:01:33,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:33,664 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 06:01:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:01:33,664 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 06:01:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:33,664 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 06:01:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 06:01:33,665 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 06:01:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 06:01:33,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-15 06:01:33,687 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:01:33,687 INFO L225 Difference]: With dead ends: 29 [2022-04-15 06:01:33,687 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 06:01:33,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:01:33,689 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:33,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:01:33,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 06:01:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 06:01:33,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:33,712 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 06:01:33,712 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 06:01:33,712 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 06:01:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:33,713 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 06:01:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 06:01:33,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:33,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:33,713 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 06:01:33,713 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 06:01:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:33,714 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 06:01:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 06:01:33,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:33,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:33,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:33,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:33,714 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 06:01:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 06:01:33,715 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-15 06:01:33,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:33,715 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 06:01:33,719 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 06:01:33,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 06:01:33,737 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 06:01:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 06:01:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:01:33,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:33,737 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:33,744 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 06:01:33,961 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 06:01:34,138 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 06:01:34,138 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:34,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 23 times [2022-04-15 06:01:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:34,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1610990385] [2022-04-15 06:01:34,319 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:34,321 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1217149001, now seen corresponding path program 1 times [2022-04-15 06:01:34,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:34,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397832157] [2022-04-15 06:01:34,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:34,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:34,328 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:34,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2128880473] [2022-04-15 06:01:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:34,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:34,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:34,333 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 06:01:34,334 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 06:01:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:34,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:34,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:34,382 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 24 times [2022-04-15 06:01:34,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:34,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143576668] [2022-04-15 06:01:34,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:34,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:34,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:34,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {3133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3115#true} is VALID [2022-04-15 06:01:34,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-15 06:01:34,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-15 06:01:34,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:34,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {3133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3115#true} is VALID [2022-04-15 06:01:34,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-15 06:01:34,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-15 06:01:34,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret4 := main(); {3115#true} is VALID [2022-04-15 06:01:34,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {3115#true} ~x~0 := 268435441; {3120#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:34,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {3120#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3121#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:34,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {3121#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3122#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:34,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {3122#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3123#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:34,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {3123#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3124#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:34,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {3124#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3125#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:34,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {3125#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3126#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:34,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {3126#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3127#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:34,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {3127#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3128#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:34,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {3128#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3129#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:34,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {3129#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3130#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:34,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {3130#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3131#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:34,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {3131#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3132#(and (<= (div main_~x~0 4294967296) 0) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:34,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {3132#(and (<= (div main_~x~0 4294967296) 0) (<= 268435417 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {3116#false} is VALID [2022-04-15 06:01:34,635 INFO L272 TraceCheckUtils]: 19: Hoare triple {3116#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3116#false} is VALID [2022-04-15 06:01:34,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2022-04-15 06:01:34,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2022-04-15 06:01:34,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2022-04-15 06:01:34,635 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 06:01:34,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:34,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143576668] [2022-04-15 06:01:34,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143576668] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:34,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910935869] [2022-04-15 06:01:34,636 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:34,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:34,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:34,648 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 06:01:34,649 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 06:01:34,742 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 06:01:34,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:34,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 06:01:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:34,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:34,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3115#true} is VALID [2022-04-15 06:01:34,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {3115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3115#true} is VALID [2022-04-15 06:01:34,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-15 06:01:35,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-15 06:01:35,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret4 := main(); {3115#true} is VALID [2022-04-15 06:01:35,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {3115#true} ~x~0 := 268435441; {3120#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:35,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {3120#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3121#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:35,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {3121#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3122#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:35,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {3122#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3123#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:35,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {3123#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3124#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:35,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {3124#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3125#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:35,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {3125#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3126#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:35,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {3126#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3127#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:35,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {3127#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3128#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:35,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {3128#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3129#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:35,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {3129#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3130#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:35,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {3130#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3131#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:35,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {3131#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3188#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:35,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {3188#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {3116#false} is VALID [2022-04-15 06:01:35,008 INFO L272 TraceCheckUtils]: 19: Hoare triple {3116#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3116#false} is VALID [2022-04-15 06:01:35,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2022-04-15 06:01:35,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2022-04-15 06:01:35,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2022-04-15 06:01:35,008 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 06:01:35,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:35,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2022-04-15 06:01:35,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2022-04-15 06:01:35,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2022-04-15 06:01:35,416 INFO L272 TraceCheckUtils]: 19: Hoare triple {3116#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3116#false} is VALID [2022-04-15 06:01:35,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {3216#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {3116#false} is VALID [2022-04-15 06:01:35,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {3220#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3216#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:01:35,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {3224#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3220#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:01:35,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {3228#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3224#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:35,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {3232#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3228#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:35,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {3236#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3232#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:35,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {3240#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3236#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:01:35,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3240#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:01:35,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {3248#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3244#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:35,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {3252#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3248#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:01:35,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {3256#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3252#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:01:35,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {3260#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3256#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:35,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {3264#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3260#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:35,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {3115#true} ~x~0 := 268435441; {3264#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:35,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret4 := main(); {3115#true} is VALID [2022-04-15 06:01:35,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-15 06:01:35,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-15 06:01:35,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {3115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3115#true} is VALID [2022-04-15 06:01:35,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3115#true} is VALID [2022-04-15 06:01:35,430 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 06:01:35,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910935869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:35,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:35,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 06:01:35,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:35,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1610990385] [2022-04-15 06:01:35,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1610990385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:35,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:35,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:01:35,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955884679] [2022-04-15 06:01:35,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:35,432 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 06:01:35,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:35,432 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 06:01:35,446 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 06:01:35,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:01:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:35,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:01:35,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:01:35,447 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 06:01:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:36,071 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 06:01:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:01:36,072 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 06:01:36,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:36,072 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 06:01:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 06:01:36,073 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 06:01:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 06:01:36,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-15 06:01:36,098 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:01:36,098 INFO L225 Difference]: With dead ends: 30 [2022-04-15 06:01:36,098 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 06:01:36,099 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=497, Invalid=1309, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:01:36,099 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:36,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:01:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 06:01:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 06:01:36,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:36,134 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 06:01:36,134 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 06:01:36,134 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 06:01:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:36,134 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 06:01:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 06:01:36,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:36,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:36,135 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 06:01:36,135 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 06:01:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:36,135 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 06:01:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 06:01:36,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:36,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:36,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:36,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:36,136 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 06:01:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 06:01:36,136 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-15 06:01:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:36,136 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 06:01:36,136 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 06:01:36,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 06:01:36,162 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:01:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 06:01:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:01:36,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:36,163 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:36,168 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 06:01:36,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:36,567 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 06:01:36,568 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:36,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 25 times [2022-04-15 06:01:36,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:36,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2005119875] [2022-04-15 06:01:36,706 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:36,708 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:36,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1158043657, now seen corresponding path program 1 times [2022-04-15 06:01:36,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:36,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483147977] [2022-04-15 06:01:36,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:36,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:36,715 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:36,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357335557] [2022-04-15 06:01:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:36,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:36,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:36,721 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 06:01:36,721 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 06:01:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:36,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:36,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 26 times [2022-04-15 06:01:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:36,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183170797] [2022-04-15 06:01:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:36,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:36,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {3490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3471#true} is VALID [2022-04-15 06:01:36,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-15 06:01:36,991 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-15 06:01:36,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:36,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {3490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3471#true} is VALID [2022-04-15 06:01:36,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-15 06:01:36,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-15 06:01:36,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {3471#true} call #t~ret4 := main(); {3471#true} is VALID [2022-04-15 06:01:36,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {3471#true} ~x~0 := 268435441; {3476#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:36,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {3476#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3477#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:36,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {3477#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3478#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:36,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {3478#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3479#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:37,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3480#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:37,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {3480#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3481#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:37,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {3481#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3482#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:37,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {3482#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3483#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:37,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {3483#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3484#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:37,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {3484#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3485#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:37,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {3485#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3486#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:37,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {3486#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3487#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:37,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {3487#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3488#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:37,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {3488#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3489#(and (<= 268435415 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:01:37,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {3489#(and (<= 268435415 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {3472#false} is VALID [2022-04-15 06:01:37,009 INFO L272 TraceCheckUtils]: 20: Hoare triple {3472#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3472#false} is VALID [2022-04-15 06:01:37,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2022-04-15 06:01:37,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2022-04-15 06:01:37,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2022-04-15 06:01:37,010 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 06:01:37,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:37,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183170797] [2022-04-15 06:01:37,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183170797] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:37,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977800097] [2022-04-15 06:01:37,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:37,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:37,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:37,011 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 06:01:37,012 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 06:01:37,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:37,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:37,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 06:01:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:37,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:37,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3471#true} is VALID [2022-04-15 06:01:37,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {3471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3471#true} is VALID [2022-04-15 06:01:37,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-15 06:01:37,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-15 06:01:37,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {3471#true} call #t~ret4 := main(); {3471#true} is VALID [2022-04-15 06:01:37,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {3471#true} ~x~0 := 268435441; {3476#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:37,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {3476#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3477#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:37,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {3477#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3478#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:37,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {3478#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3479#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:37,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3480#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:37,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {3480#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3481#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:37,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {3481#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3482#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:37,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {3482#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3483#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:37,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {3483#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3484#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:37,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {3484#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3485#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:37,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {3485#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3486#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:37,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {3486#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3487#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:37,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {3487#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3488#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:37,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {3488#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3548#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:37,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {3548#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !(~x~0 % 4294967296 > 1); {3472#false} is VALID [2022-04-15 06:01:37,317 INFO L272 TraceCheckUtils]: 20: Hoare triple {3472#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3472#false} is VALID [2022-04-15 06:01:37,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2022-04-15 06:01:37,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2022-04-15 06:01:37,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2022-04-15 06:01:37,318 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 06:01:37,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:37,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2022-04-15 06:01:37,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2022-04-15 06:01:37,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2022-04-15 06:01:37,731 INFO L272 TraceCheckUtils]: 20: Hoare triple {3472#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3472#false} is VALID [2022-04-15 06:01:37,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {3576#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {3472#false} is VALID [2022-04-15 06:01:37,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {3580#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3576#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:01:37,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {3584#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3580#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:01:37,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {3588#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3584#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:37,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {3592#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3588#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:37,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {3596#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3592#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:37,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {3600#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3596#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:01:37,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {3604#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3600#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:01:37,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {3608#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3604#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:37,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {3612#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3608#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:01:37,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {3616#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3612#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:01:37,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {3620#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3616#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:37,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {3624#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3620#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:37,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {3628#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3624#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:37,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {3471#true} ~x~0 := 268435441; {3628#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:01:37,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {3471#true} call #t~ret4 := main(); {3471#true} is VALID [2022-04-15 06:01:37,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-15 06:01:37,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-15 06:01:37,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {3471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3471#true} is VALID [2022-04-15 06:01:37,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3471#true} is VALID [2022-04-15 06:01:37,745 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 06:01:37,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977800097] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:37,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:37,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 06:01:37,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:37,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2005119875] [2022-04-15 06:01:37,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2005119875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:37,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:37,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:01:37,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731364877] [2022-04-15 06:01:37,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:37,747 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:01:37,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:37,747 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 06:01:37,768 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 06:01:37,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:01:37,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:37,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:01:37,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:01:37,769 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:01:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:38,406 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 06:01:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:01:38,406 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:01:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:38,406 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:01:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 06:01:38,407 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:01:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 06:01:38,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-15 06:01:38,430 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:01:38,431 INFO L225 Difference]: With dead ends: 31 [2022-04-15 06:01:38,431 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 06:01:38,432 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=563, Invalid=1507, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:01:38,432 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:38,432 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:01:38,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 06:01:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 06:01:38,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:38,455 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:01:38,455 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:01:38,455 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:01:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:38,458 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 06:01:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 06:01:38,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:38,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:38,460 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:01:38,460 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:01:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:38,463 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 06:01:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 06:01:38,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:38,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:38,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:38,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:38,464 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:01:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-15 06:01:38,465 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-15 06:01:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:38,465 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-15 06:01:38,465 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:01:38,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-15 06:01:38,491 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:01:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 06:01:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:01:38,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:38,492 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:38,508 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:01:38,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:38,892 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:01:38,893 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:38,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:38,893 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 27 times [2022-04-15 06:01:38,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:38,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [5252598] [2022-04-15 06:01:39,070 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:39,072 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1098938313, now seen corresponding path program 1 times [2022-04-15 06:01:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:39,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837154455] [2022-04-15 06:01:39,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:39,081 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:39,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832725666] [2022-04-15 06:01:39,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:39,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:39,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:39,096 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:01:39,131 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:01:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:39,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:39,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 28 times [2022-04-15 06:01:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:39,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583452622] [2022-04-15 06:01:39,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:39,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:39,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {3863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3843#true} is VALID [2022-04-15 06:01:39,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-15 06:01:39,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-15 06:01:39,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {3843#true} call ULTIMATE.init(); {3863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:39,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {3863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3843#true} is VALID [2022-04-15 06:01:39,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-15 06:01:39,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-15 06:01:39,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {3843#true} call #t~ret4 := main(); {3843#true} is VALID [2022-04-15 06:01:39,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {3843#true} ~x~0 := 268435441; {3848#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:39,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {3848#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3849#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:39,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {3849#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3850#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:39,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {3850#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3851#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:39,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {3851#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3852#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:39,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {3852#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3853#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:39,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {3853#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3854#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:39,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {3854#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3855#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:39,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {3855#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3856#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:39,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {3856#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3857#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:39,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {3857#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3858#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:39,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3859#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:39,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {3859#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3860#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:39,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {3860#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3861#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:39,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {3861#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3862#(and (<= 268435413 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:01:39,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {3862#(and (<= 268435413 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {3844#false} is VALID [2022-04-15 06:01:39,434 INFO L272 TraceCheckUtils]: 21: Hoare triple {3844#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3844#false} is VALID [2022-04-15 06:01:39,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {3844#false} ~cond := #in~cond; {3844#false} is VALID [2022-04-15 06:01:39,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {3844#false} assume 0 == ~cond; {3844#false} is VALID [2022-04-15 06:01:39,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-04-15 06:01:39,434 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:01:39,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:39,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583452622] [2022-04-15 06:01:39,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583452622] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:39,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311011632] [2022-04-15 06:01:39,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:39,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:39,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:39,436 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:01:39,438 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:01:39,469 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:39,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:39,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 06:01:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:39,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:39,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {3843#true} call ULTIMATE.init(); {3843#true} is VALID [2022-04-15 06:01:39,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3843#true} is VALID [2022-04-15 06:01:39,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-15 06:01:39,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-15 06:01:39,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {3843#true} call #t~ret4 := main(); {3843#true} is VALID [2022-04-15 06:01:39,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {3843#true} ~x~0 := 268435441; {3848#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:39,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {3848#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3849#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:39,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {3849#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3850#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:39,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {3850#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3851#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:39,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {3851#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3852#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:39,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {3852#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3853#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:39,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {3853#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3854#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:39,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {3854#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3855#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:39,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {3855#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3856#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:39,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {3856#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3857#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:39,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {3857#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3858#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:39,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3859#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:39,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {3859#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3860#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:39,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {3860#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3861#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:39,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {3861#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3924#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:39,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {3924#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !(~x~0 % 4294967296 > 1); {3844#false} is VALID [2022-04-15 06:01:39,820 INFO L272 TraceCheckUtils]: 21: Hoare triple {3844#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3844#false} is VALID [2022-04-15 06:01:39,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {3844#false} ~cond := #in~cond; {3844#false} is VALID [2022-04-15 06:01:39,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {3844#false} assume 0 == ~cond; {3844#false} is VALID [2022-04-15 06:01:39,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-04-15 06:01:39,821 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:01:39,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:40,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-04-15 06:01:40,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {3844#false} assume 0 == ~cond; {3844#false} is VALID [2022-04-15 06:01:40,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {3844#false} ~cond := #in~cond; {3844#false} is VALID [2022-04-15 06:01:40,291 INFO L272 TraceCheckUtils]: 21: Hoare triple {3844#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3844#false} is VALID [2022-04-15 06:01:40,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {3952#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {3844#false} is VALID [2022-04-15 06:01:40,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {3956#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3952#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:01:40,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {3960#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3956#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:01:40,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {3964#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3960#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:40,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {3968#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3964#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:40,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {3972#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3968#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:40,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {3976#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3972#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:01:40,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {3980#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3976#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:01:40,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {3984#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3980#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:40,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {3988#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3984#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:01:40,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {3992#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3988#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:01:40,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {3996#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3992#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:40,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {4000#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3996#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:40,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {4004#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4000#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:40,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {4008#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4004#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:01:40,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {3843#true} ~x~0 := 268435441; {4008#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:01:40,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {3843#true} call #t~ret4 := main(); {3843#true} is VALID [2022-04-15 06:01:40,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-15 06:01:40,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-15 06:01:40,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3843#true} is VALID [2022-04-15 06:01:40,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {3843#true} call ULTIMATE.init(); {3843#true} is VALID [2022-04-15 06:01:40,305 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:01:40,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311011632] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:40,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:40,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 06:01:40,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:40,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [5252598] [2022-04-15 06:01:40,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [5252598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:40,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:40,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:01:40,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781288519] [2022-04-15 06:01:40,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:40,306 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:01:40,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:40,307 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:01:40,322 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:01:40,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:01:40,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:40,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:01:40,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:01:40,324 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:01:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:40,968 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 06:01:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:01:40,969 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:01:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:40,969 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:01:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 06:01:40,971 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:01:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 06:01:40,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-15 06:01:40,996 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:01:40,996 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:01:40,996 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:01:40,997 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=633, Invalid=1719, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:01:40,998 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:40,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:01:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:01:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 06:01:41,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:41,019 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:01:41,019 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:01:41,019 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:01:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:41,020 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 06:01:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 06:01:41,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:41,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:41,020 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:01:41,020 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:01:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:41,021 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 06:01:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 06:01:41,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:41,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:41,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:41,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:41,021 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:01:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 06:01:41,022 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-15 06:01:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:41,022 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 06:01:41,022 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:01:41,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 06:01:41,044 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:01:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 06:01:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:01:41,045 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:41,045 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:41,049 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:01:41,263 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:01:41,447 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:01:41,447 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:41,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 29 times [2022-04-15 06:01:41,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:41,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531528572] [2022-04-15 06:01:41,667 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:41,670 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:41,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1039832969, now seen corresponding path program 1 times [2022-04-15 06:01:41,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:41,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631945991] [2022-04-15 06:01:41,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:41,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:41,679 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:41,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302295953] [2022-04-15 06:01:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:41,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:41,697 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:01:41,698 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:01:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:41,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:41,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 30 times [2022-04-15 06:01:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:41,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453690605] [2022-04-15 06:01:41,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:42,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:42,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {4252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4231#true} is VALID [2022-04-15 06:01:42,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-15 06:01:42,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-15 06:01:42,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {4231#true} call ULTIMATE.init(); {4252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:42,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {4252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4231#true} is VALID [2022-04-15 06:01:42,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-15 06:01:42,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-15 06:01:42,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {4231#true} call #t~ret4 := main(); {4231#true} is VALID [2022-04-15 06:01:42,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {4231#true} ~x~0 := 268435441; {4236#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:42,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {4236#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4237#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:42,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {4237#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4238#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:42,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {4238#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4239#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:42,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {4239#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4240#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:42,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {4240#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4241#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:42,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {4241#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4242#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:42,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {4242#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4243#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:42,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {4243#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4244#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:42,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {4244#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4245#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:42,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {4245#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4246#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:42,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {4246#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4247#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:42,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {4247#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4248#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:42,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {4248#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4249#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:42,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {4249#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4250#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:42,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {4250#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4251#(and (<= (div main_~x~0 4294967296) 0) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:42,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {4251#(and (<= (div main_~x~0 4294967296) 0) (<= 268435411 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {4232#false} is VALID [2022-04-15 06:01:42,039 INFO L272 TraceCheckUtils]: 22: Hoare triple {4232#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4232#false} is VALID [2022-04-15 06:01:42,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {4232#false} ~cond := #in~cond; {4232#false} is VALID [2022-04-15 06:01:42,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {4232#false} assume 0 == ~cond; {4232#false} is VALID [2022-04-15 06:01:42,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-04-15 06:01:42,040 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:01:42,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:42,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453690605] [2022-04-15 06:01:42,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453690605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:42,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362601012] [2022-04-15 06:01:42,040 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:42,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:42,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:42,041 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:01:42,043 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:01:42,318 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 06:01:42,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:42,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:01:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:42,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:42,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {4231#true} call ULTIMATE.init(); {4231#true} is VALID [2022-04-15 06:01:42,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {4231#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4231#true} is VALID [2022-04-15 06:01:42,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-15 06:01:42,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-15 06:01:42,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {4231#true} call #t~ret4 := main(); {4231#true} is VALID [2022-04-15 06:01:42,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {4231#true} ~x~0 := 268435441; {4236#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:42,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {4236#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4237#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:42,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {4237#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4238#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:42,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {4238#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4239#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:42,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {4239#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4240#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:42,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {4240#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4241#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:42,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {4241#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4242#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:42,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {4242#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4243#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:42,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {4243#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4244#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:42,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {4244#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4245#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:42,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {4245#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4246#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:42,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {4246#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4247#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:42,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {4247#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4248#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:42,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {4248#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4249#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:42,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {4249#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4250#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:42,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {4250#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4316#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:42,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {4316#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {4232#false} is VALID [2022-04-15 06:01:42,639 INFO L272 TraceCheckUtils]: 22: Hoare triple {4232#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4232#false} is VALID [2022-04-15 06:01:42,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {4232#false} ~cond := #in~cond; {4232#false} is VALID [2022-04-15 06:01:42,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {4232#false} assume 0 == ~cond; {4232#false} is VALID [2022-04-15 06:01:42,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-04-15 06:01:42,640 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:01:42,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:43,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-04-15 06:01:43,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {4335#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4232#false} is VALID [2022-04-15 06:01:43,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {4339#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4335#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:43,599 INFO L272 TraceCheckUtils]: 22: Hoare triple {4343#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4339#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:43,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {4347#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {4343#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:01:43,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {4351#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4347#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {4355#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4351#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {4359#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4355#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {4363#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4359#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {4367#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4363#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {4371#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4367#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {4375#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4371#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {4379#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4375#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {4383#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4379#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {4387#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4383#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {4391#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4387#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {4395#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4391#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {4399#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4395#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {4403#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4399#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {4407#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4403#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {4231#true} ~x~0 := 268435441; {4407#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:43,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {4231#true} call #t~ret4 := main(); {4231#true} is VALID [2022-04-15 06:01:43,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-15 06:01:43,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-15 06:01:43,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {4231#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4231#true} is VALID [2022-04-15 06:01:43,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {4231#true} call ULTIMATE.init(); {4231#true} is VALID [2022-04-15 06:01:43,624 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:01:43,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362601012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:43,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:43,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 21] total 39 [2022-04-15 06:01:43,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:43,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531528572] [2022-04-15 06:01:43,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531528572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:43,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:43,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:01:43,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274849688] [2022-04-15 06:01:43,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:43,626 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:01:43,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:43,626 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:01:43,645 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:01:43,646 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:01:43,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:01:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1103, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:01:43,647 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:01:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:44,482 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 06:01:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:01:44,483 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:01:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:44,484 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:01:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 06:01:44,486 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:01:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 06:01:44,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-15 06:01:44,514 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:01:44,515 INFO L225 Difference]: With dead ends: 33 [2022-04-15 06:01:44,515 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 06:01:44,516 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=729, Invalid=2241, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:01:44,517 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:44,517 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:01:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 06:01:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 06:01:44,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:44,543 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:01:44,543 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:01:44,543 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:01:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:44,544 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 06:01:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 06:01:44,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:44,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:44,544 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:01:44,545 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:01:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:44,545 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 06:01:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 06:01:44,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:44,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:44,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:44,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:44,546 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:01:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-15 06:01:44,546 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-15 06:01:44,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:44,547 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-15 06:01:44,547 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:01:44,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-15 06:01:44,572 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:01:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 06:01:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:01:44,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:44,574 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:44,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 06:01:44,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:44,975 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:01:44,975 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:44,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 31 times [2022-04-15 06:01:44,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:44,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2134792525] [2022-04-15 06:01:45,142 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:45,144 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:45,146 INFO L85 PathProgramCache]: Analyzing trace with hash -980727625, now seen corresponding path program 1 times [2022-04-15 06:01:45,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:45,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871757384] [2022-04-15 06:01:45,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:45,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:45,152 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:45,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152153449] [2022-04-15 06:01:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:45,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:45,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:45,163 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:01:45,171 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:01:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:45,200 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:45,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:45,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 32 times [2022-04-15 06:01:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:45,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97877589] [2022-04-15 06:01:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:45,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {4660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4638#true} is VALID [2022-04-15 06:01:45,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-15 06:01:45,462 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-15 06:01:45,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {4638#true} call ULTIMATE.init(); {4660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:45,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {4660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4638#true} is VALID [2022-04-15 06:01:45,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-15 06:01:45,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-15 06:01:45,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {4638#true} call #t~ret4 := main(); {4638#true} is VALID [2022-04-15 06:01:45,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {4638#true} ~x~0 := 268435441; {4643#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:45,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {4643#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4644#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:45,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {4644#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4645#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:45,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {4645#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4646#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:45,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {4646#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4647#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:45,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {4647#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4648#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:45,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {4648#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4649#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:45,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {4649#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4650#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:45,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {4650#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4651#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:45,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {4651#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4652#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:45,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {4652#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4653#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:45,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {4653#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4654#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:45,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {4654#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4655#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:45,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {4655#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4656#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:45,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {4656#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4657#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:45,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {4657#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4658#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:45,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {4658#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4659#(and (<= (div main_~x~0 4294967296) 0) (<= 268435409 main_~x~0))} is VALID [2022-04-15 06:01:45,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {4659#(and (<= (div main_~x~0 4294967296) 0) (<= 268435409 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {4639#false} is VALID [2022-04-15 06:01:45,472 INFO L272 TraceCheckUtils]: 23: Hoare triple {4639#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4639#false} is VALID [2022-04-15 06:01:45,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {4639#false} ~cond := #in~cond; {4639#false} is VALID [2022-04-15 06:01:45,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {4639#false} assume 0 == ~cond; {4639#false} is VALID [2022-04-15 06:01:45,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {4639#false} assume !false; {4639#false} is VALID [2022-04-15 06:01:45,473 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:01:45,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:45,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97877589] [2022-04-15 06:01:45,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97877589] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:45,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999705318] [2022-04-15 06:01:45,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:45,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:45,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:45,474 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:01:45,475 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:01:45,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:45,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:45,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 06:01:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:45,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:45,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {4638#true} call ULTIMATE.init(); {4638#true} is VALID [2022-04-15 06:01:45,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {4638#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4638#true} is VALID [2022-04-15 06:01:45,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-15 06:01:45,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-15 06:01:45,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {4638#true} call #t~ret4 := main(); {4638#true} is VALID [2022-04-15 06:01:45,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {4638#true} ~x~0 := 268435441; {4643#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:45,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {4643#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4644#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:45,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {4644#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4645#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:45,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {4645#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4646#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:45,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {4646#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4647#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:45,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {4647#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4648#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:45,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {4648#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4649#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:45,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {4649#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4650#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:45,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {4650#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4651#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:45,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {4651#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4652#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:45,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {4652#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4653#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:45,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {4653#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4654#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:45,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {4654#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4655#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:45,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {4655#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4656#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:45,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {4656#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4657#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:45,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {4657#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4658#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:45,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {4658#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4727#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:01:45,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {4727#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !(~x~0 % 4294967296 > 1); {4639#false} is VALID [2022-04-15 06:01:45,727 INFO L272 TraceCheckUtils]: 23: Hoare triple {4639#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4639#false} is VALID [2022-04-15 06:01:45,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {4639#false} ~cond := #in~cond; {4639#false} is VALID [2022-04-15 06:01:45,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {4639#false} assume 0 == ~cond; {4639#false} is VALID [2022-04-15 06:01:45,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {4639#false} assume !false; {4639#false} is VALID [2022-04-15 06:01:45,728 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:01:45,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:46,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {4639#false} assume !false; {4639#false} is VALID [2022-04-15 06:01:46,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {4746#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4639#false} is VALID [2022-04-15 06:01:46,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {4750#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4746#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:46,675 INFO L272 TraceCheckUtils]: 23: Hoare triple {4754#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4750#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:46,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {4758#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {4754#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:01:46,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {4762#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4758#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {4766#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4762#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {4770#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4766#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {4774#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4770#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {4778#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4774#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {4782#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4778#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {4786#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4782#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {4790#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4786#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {4794#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4790#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {4798#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4794#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {4802#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4798#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {4806#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4802#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {4810#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4806#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {4814#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4810#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {4818#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4814#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {4822#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4818#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {4638#true} ~x~0 := 268435441; {4822#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:46,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {4638#true} call #t~ret4 := main(); {4638#true} is VALID [2022-04-15 06:01:46,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-15 06:01:46,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-15 06:01:46,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {4638#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4638#true} is VALID [2022-04-15 06:01:46,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {4638#true} call ULTIMATE.init(); {4638#true} is VALID [2022-04-15 06:01:46,694 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:01:46,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999705318] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:46,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:46,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 22] total 41 [2022-04-15 06:01:46,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:46,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2134792525] [2022-04-15 06:01:46,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2134792525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:46,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:46,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:01:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059518326] [2022-04-15 06:01:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:46,695 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:01:46,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:46,695 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:01:46,712 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:01:46,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:01:46,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:46,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:01:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1221, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:01:46,713 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:01:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:47,590 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 06:01:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:01:47,591 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:01:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:47,591 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:01:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 06:01:47,592 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:01:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 06:01:47,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-15 06:01:47,617 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:01:47,617 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:01:47,617 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 06:01:47,619 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=808, Invalid=2498, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:01:47,619 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:47,619 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:01:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 06:01:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 06:01:47,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:47,645 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:01:47,645 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:01:47,645 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:01:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:47,646 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 06:01:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 06:01:47,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:47,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:47,646 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:01:47,646 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:01:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:47,647 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 06:01:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 06:01:47,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:47,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:47,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:47,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:47,648 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:01:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-15 06:01:47,648 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-15 06:01:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:47,648 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-15 06:01:47,649 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:01:47,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-15 06:01:47,673 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:01:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 06:01:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:01:47,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:47,673 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:47,677 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:01:47,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-15 06:01:48,077 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:01:48,078 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:48,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 33 times [2022-04-15 06:01:48,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:48,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [937254613] [2022-04-15 06:01:48,253 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:48,255 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:48,257 INFO L85 PathProgramCache]: Analyzing trace with hash -921622281, now seen corresponding path program 1 times [2022-04-15 06:01:48,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:48,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910004229] [2022-04-15 06:01:48,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:48,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:48,262 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_17.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:48,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864389415] [2022-04-15 06:01:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:48,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:48,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:48,267 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:01:48,268 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:01:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:48,317 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:48,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:48,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 34 times [2022-04-15 06:01:48,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:48,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089371241] [2022-04-15 06:01:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:48,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:48,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {5084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5061#true} is VALID [2022-04-15 06:01:48,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-15 06:01:48,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-15 06:01:48,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {5061#true} call ULTIMATE.init(); {5084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:48,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {5084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5061#true} is VALID [2022-04-15 06:01:48,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-15 06:01:48,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-15 06:01:48,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {5061#true} call #t~ret4 := main(); {5061#true} is VALID [2022-04-15 06:01:48,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {5061#true} ~x~0 := 268435441; {5066#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:48,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {5066#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5067#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:48,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {5067#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5068#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:48,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {5068#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5069#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:48,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {5069#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5070#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:48,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {5070#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5071#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:48,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {5071#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5072#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:48,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {5072#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5073#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:48,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {5073#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5074#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:48,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {5074#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5075#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:48,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {5075#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5076#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:48,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {5076#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5077#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:48,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {5077#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5078#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:48,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {5078#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5079#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:48,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {5079#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5080#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:48,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {5080#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5081#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:48,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {5081#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5082#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:01:48,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {5082#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5083#(and (<= (div main_~x~0 4294967296) 0) (<= 268435407 main_~x~0))} is VALID [2022-04-15 06:01:48,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {5083#(and (<= (div main_~x~0 4294967296) 0) (<= 268435407 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {5062#false} is VALID [2022-04-15 06:01:48,692 INFO L272 TraceCheckUtils]: 24: Hoare triple {5062#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5062#false} is VALID [2022-04-15 06:01:48,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {5062#false} ~cond := #in~cond; {5062#false} is VALID [2022-04-15 06:01:48,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {5062#false} assume 0 == ~cond; {5062#false} is VALID [2022-04-15 06:01:48,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {5062#false} assume !false; {5062#false} is VALID [2022-04-15 06:01:48,693 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:01:48,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:48,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089371241] [2022-04-15 06:01:48,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089371241] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:48,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134789053] [2022-04-15 06:01:48,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:48,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:48,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:48,695 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:01:48,696 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:01:48,731 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:48,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:48,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 06:01:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:48,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:49,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {5061#true} call ULTIMATE.init(); {5061#true} is VALID [2022-04-15 06:01:49,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {5061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5061#true} is VALID [2022-04-15 06:01:49,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-15 06:01:49,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-15 06:01:49,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {5061#true} call #t~ret4 := main(); {5061#true} is VALID [2022-04-15 06:01:49,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {5061#true} ~x~0 := 268435441; {5066#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:49,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {5066#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5067#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:49,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {5067#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5068#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:49,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {5068#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5069#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:49,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {5069#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5070#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:49,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {5070#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5071#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:49,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {5071#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5072#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:49,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {5072#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5073#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:49,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {5073#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5074#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:49,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {5074#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5075#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:49,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {5075#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5076#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:49,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {5076#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5077#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:49,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {5077#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5078#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:49,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {5078#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5079#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:49,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {5079#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5080#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:49,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {5080#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5081#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:49,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {5081#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5082#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:01:49,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {5082#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5154#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:01:49,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {5154#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !(~x~0 % 4294967296 > 1); {5062#false} is VALID [2022-04-15 06:01:49,062 INFO L272 TraceCheckUtils]: 24: Hoare triple {5062#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5062#false} is VALID [2022-04-15 06:01:49,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {5062#false} ~cond := #in~cond; {5062#false} is VALID [2022-04-15 06:01:49,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {5062#false} assume 0 == ~cond; {5062#false} is VALID [2022-04-15 06:01:49,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {5062#false} assume !false; {5062#false} is VALID [2022-04-15 06:01:49,062 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:01:49,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:49,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {5062#false} assume !false; {5062#false} is VALID [2022-04-15 06:01:49,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {5062#false} assume 0 == ~cond; {5062#false} is VALID [2022-04-15 06:01:49,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {5062#false} ~cond := #in~cond; {5062#false} is VALID [2022-04-15 06:01:49,686 INFO L272 TraceCheckUtils]: 24: Hoare triple {5062#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5062#false} is VALID [2022-04-15 06:01:49,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {5182#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {5062#false} is VALID [2022-04-15 06:01:49,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {5186#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5182#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:01:49,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {5190#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5186#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:01:49,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {5194#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5190#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:49,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {5198#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5194#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:49,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {5202#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5198#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:49,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {5206#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5202#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:01:49,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {5210#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5206#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:01:49,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {5214#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5210#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:49,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {5218#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5214#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:01:49,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {5222#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5218#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:01:49,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {5226#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5222#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:49,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {5230#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5226#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:49,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {5234#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5230#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:01:49,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {5238#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5234#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:01:49,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {5242#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5238#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:01:49,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {5246#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5242#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:01:49,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {5250#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5246#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:01:49,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {5061#true} ~x~0 := 268435441; {5250#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:01:49,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {5061#true} call #t~ret4 := main(); {5061#true} is VALID [2022-04-15 06:01:49,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-15 06:01:49,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-15 06:01:49,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {5061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5061#true} is VALID [2022-04-15 06:01:49,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {5061#true} call ULTIMATE.init(); {5061#true} is VALID [2022-04-15 06:01:49,714 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:01:49,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134789053] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:49,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:49,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 06:01:49,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:49,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [937254613] [2022-04-15 06:01:49,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [937254613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:49,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:49,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:01:49,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829493639] [2022-04-15 06:01:49,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:49,715 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:01:49,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:49,715 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:01:49,735 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:01:49,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:01:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:49,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:01:49,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:01:49,736 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:01:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:50,656 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 06:01:50,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:01:50,656 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:01:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:50,657 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:01:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 06:01:50,657 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:01:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 06:01:50,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-15 06:01:50,685 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:01:50,685 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:01:50,686 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:01:50,687 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=867, Invalid=2439, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:01:50,687 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:50,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:01:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:01:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 06:01:50,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:50,720 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:01:50,720 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:01:50,720 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:01:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:50,720 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 06:01:50,720 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 06:01:50,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:50,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:50,721 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:01:50,721 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:01:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:50,721 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 06:01:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 06:01:50,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:50,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:50,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:50,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:50,722 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:01:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-15 06:01:50,722 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-15 06:01:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:50,722 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-15 06:01:50,724 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:01:50,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-15 06:01:50,751 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:01:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 06:01:50,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:01:50,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:50,752 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:50,757 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:01:50,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:51,157 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:01:51,157 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 35 times [2022-04-15 06:01:51,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:51,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1276079205] [2022-04-15 06:01:51,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:01:51,327 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash -862516937, now seen corresponding path program 1 times [2022-04-15 06:01:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:51,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739841353] [2022-04-15 06:01:51,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:51,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:51,337 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_18.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:51,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140287050] [2022-04-15 06:01:51,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:51,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:51,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:51,343 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:01:51,369 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:01:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:51,394 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:51,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:51,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 36 times [2022-04-15 06:01:51,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:51,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154863169] [2022-04-15 06:01:51,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:51,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:51,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {5521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5497#true} is VALID [2022-04-15 06:01:51,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-15 06:01:51,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-15 06:01:51,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:51,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {5521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5497#true} is VALID [2022-04-15 06:01:51,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-15 06:01:51,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-15 06:01:51,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {5497#true} call #t~ret4 := main(); {5497#true} is VALID [2022-04-15 06:01:51,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {5497#true} ~x~0 := 268435441; {5502#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:51,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {5502#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5503#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:51,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {5503#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5504#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:51,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {5504#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5505#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:51,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {5505#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5506#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:51,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {5506#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5507#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:51,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {5507#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5508#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:51,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {5508#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5509#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:51,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {5509#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5510#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:51,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {5510#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5511#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:51,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {5511#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5512#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:51,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {5512#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5513#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:51,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {5513#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5514#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:51,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {5514#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5515#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:51,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {5515#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5516#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:51,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {5516#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5517#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:51,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {5517#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5518#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:01:51,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {5518#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5519#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:01:51,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {5519#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5520#(and (<= (div main_~x~0 4294967296) 0) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:01:51,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {5520#(and (<= (div main_~x~0 4294967296) 0) (<= 268435405 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {5498#false} is VALID [2022-04-15 06:01:51,731 INFO L272 TraceCheckUtils]: 25: Hoare triple {5498#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5498#false} is VALID [2022-04-15 06:01:51,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {5498#false} ~cond := #in~cond; {5498#false} is VALID [2022-04-15 06:01:51,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {5498#false} assume 0 == ~cond; {5498#false} is VALID [2022-04-15 06:01:51,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-15 06:01:51,731 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:01:51,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:51,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154863169] [2022-04-15 06:01:51,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154863169] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:51,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935038451] [2022-04-15 06:01:51,732 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:51,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:51,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:51,733 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:01:51,733 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:01:52,203 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 06:01:52,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:52,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 06:01:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:52,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:52,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5497#true} is VALID [2022-04-15 06:01:52,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5497#true} is VALID [2022-04-15 06:01:52,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-15 06:01:52,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-15 06:01:52,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {5497#true} call #t~ret4 := main(); {5497#true} is VALID [2022-04-15 06:01:52,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {5497#true} ~x~0 := 268435441; {5502#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:52,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {5502#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5503#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:52,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {5503#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5504#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:52,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {5504#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5505#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:52,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {5505#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5506#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:52,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {5506#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5507#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:52,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {5507#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5508#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:52,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {5508#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5509#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:52,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {5509#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5510#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:52,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {5510#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5511#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:52,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {5511#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5512#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:52,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {5512#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5513#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:52,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {5513#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5514#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:52,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {5514#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5515#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:52,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {5515#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5516#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:52,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {5516#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5517#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:52,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {5517#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5518#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:01:52,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {5518#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5519#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:01:52,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {5519#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5594#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:01:52,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {5498#false} is VALID [2022-04-15 06:01:52,450 INFO L272 TraceCheckUtils]: 25: Hoare triple {5498#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5498#false} is VALID [2022-04-15 06:01:52,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {5498#false} ~cond := #in~cond; {5498#false} is VALID [2022-04-15 06:01:52,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {5498#false} assume 0 == ~cond; {5498#false} is VALID [2022-04-15 06:01:52,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-15 06:01:52,450 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:01:52,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:53,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-15 06:01:53,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {5613#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5498#false} is VALID [2022-04-15 06:01:53,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {5617#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5613#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:53,524 INFO L272 TraceCheckUtils]: 25: Hoare triple {5621#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5617#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:53,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {5625#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {5621#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:01:53,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {5629#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5625#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {5633#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5629#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5633#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {5641#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5637#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {5645#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5641#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {5649#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5645#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {5653#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5649#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {5657#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5653#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {5661#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5657#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {5665#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5661#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {5669#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5665#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {5673#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5669#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {5677#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5673#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {5681#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5677#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {5685#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5681#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {5689#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5685#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {5693#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5689#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {5697#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5693#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {5497#true} ~x~0 := 268435441; {5697#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:53,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {5497#true} call #t~ret4 := main(); {5497#true} is VALID [2022-04-15 06:01:53,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-15 06:01:53,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-15 06:01:53,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5497#true} is VALID [2022-04-15 06:01:53,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5497#true} is VALID [2022-04-15 06:01:53,562 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:01:53,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935038451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:53,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:53,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 24] total 45 [2022-04-15 06:01:53,563 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:53,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1276079205] [2022-04-15 06:01:53,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1276079205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:53,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:53,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:01:53,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89055853] [2022-04-15 06:01:53,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:53,564 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:01:53,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:53,564 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:01:53,583 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:01:53,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:01:53,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:53,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:01:53,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1475, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:01:53,584 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:01:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:54,608 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 06:01:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:01:54,608 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:01:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:54,609 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:01:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 06:01:54,611 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:01:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 06:01:54,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-15 06:01:54,638 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:01:54,639 INFO L225 Difference]: With dead ends: 36 [2022-04-15 06:01:54,639 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 06:01:54,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=978, Invalid=3054, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:01:54,641 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:54,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:01:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 06:01:54,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 06:01:54,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:54,665 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:01:54,665 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:01:54,665 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:01:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:54,666 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 06:01:54,666 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 06:01:54,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:54,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:54,666 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:01:54,666 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:01:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:54,667 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 06:01:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 06:01:54,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:54,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:54,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:54,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:54,667 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:01:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 06:01:54,668 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-15 06:01:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:54,668 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 06:01:54,668 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:01:54,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 06:01:54,697 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:01:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 06:01:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 06:01:54,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:54,697 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:54,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-15 06:01:54,903 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:01:55,098 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:01:55,098 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:55,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:55,098 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 37 times [2022-04-15 06:01:55,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:55,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1443588923] [2022-04-15 06:01:55,236 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:55,239 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash -803411593, now seen corresponding path program 1 times [2022-04-15 06:01:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:55,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633587111] [2022-04-15 06:01:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:55,245 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_19.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:55,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215230307] [2022-04-15 06:01:55,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:55,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:55,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:55,251 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:01:55,252 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:01:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:55,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:55,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 38 times [2022-04-15 06:01:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:55,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142263644] [2022-04-15 06:01:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:55,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:55,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {5977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5952#true} is VALID [2022-04-15 06:01:55,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-15 06:01:55,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-15 06:01:55,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:55,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {5977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5952#true} is VALID [2022-04-15 06:01:55,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-15 06:01:55,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-15 06:01:55,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret4 := main(); {5952#true} is VALID [2022-04-15 06:01:55,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {5952#true} ~x~0 := 268435441; {5957#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:55,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {5957#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5958#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:55,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {5958#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5959#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:55,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {5959#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5960#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:55,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {5960#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5961#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:55,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {5961#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5962#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:55,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {5962#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5963#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:55,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {5963#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5964#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:55,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {5964#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5965#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:55,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {5965#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5966#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:55,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {5966#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5967#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:55,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {5967#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5968#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:55,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {5968#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5969#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:55,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {5969#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5970#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:55,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {5970#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5971#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:55,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {5971#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5972#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:55,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {5972#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5973#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:01:55,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {5973#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5974#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:01:55,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {5974#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5975#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:01:55,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {5975#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5976#(and (<= (div main_~x~0 4294967296) 0) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:01:55,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {5976#(and (<= (div main_~x~0 4294967296) 0) (<= 268435403 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {5953#false} is VALID [2022-04-15 06:01:55,680 INFO L272 TraceCheckUtils]: 26: Hoare triple {5953#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5953#false} is VALID [2022-04-15 06:01:55,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {5953#false} ~cond := #in~cond; {5953#false} is VALID [2022-04-15 06:01:55,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {5953#false} assume 0 == ~cond; {5953#false} is VALID [2022-04-15 06:01:55,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2022-04-15 06:01:55,680 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:01:55,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:55,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142263644] [2022-04-15 06:01:55,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142263644] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:55,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573864751] [2022-04-15 06:01:55,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:55,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:55,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:55,682 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:01:55,683 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:01:55,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:55,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:55,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 06:01:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:55,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:55,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5952#true} is VALID [2022-04-15 06:01:55,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {5952#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5952#true} is VALID [2022-04-15 06:01:55,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-15 06:01:55,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-15 06:01:55,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret4 := main(); {5952#true} is VALID [2022-04-15 06:01:55,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {5952#true} ~x~0 := 268435441; {5957#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:55,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {5957#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5958#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:55,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {5958#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5959#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:55,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {5959#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5960#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:55,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {5960#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5961#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:55,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {5961#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5962#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:55,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {5962#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5963#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:55,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {5963#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5964#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:55,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {5964#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5965#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:55,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {5965#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5966#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:55,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {5966#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5967#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:55,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {5967#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5968#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:55,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {5968#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5969#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:55,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {5969#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5970#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:55,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {5970#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5971#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:55,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {5971#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5972#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:55,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {5972#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5973#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:01:55,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {5973#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5974#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:01:55,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {5974#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {5975#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:01:55,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {5975#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6053#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:01:55,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {6053#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {5953#false} is VALID [2022-04-15 06:01:55,957 INFO L272 TraceCheckUtils]: 26: Hoare triple {5953#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5953#false} is VALID [2022-04-15 06:01:55,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {5953#false} ~cond := #in~cond; {5953#false} is VALID [2022-04-15 06:01:55,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {5953#false} assume 0 == ~cond; {5953#false} is VALID [2022-04-15 06:01:55,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2022-04-15 06:01:55,957 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:01:55,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:57,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2022-04-15 06:01:57,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {6072#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5953#false} is VALID [2022-04-15 06:01:57,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {6076#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6072#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:01:57,063 INFO L272 TraceCheckUtils]: 26: Hoare triple {6080#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6076#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:57,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {6084#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {6080#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:01:57,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {6088#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6084#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {6092#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6088#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {6096#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6092#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {6100#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6096#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {6104#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6100#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {6108#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6104#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {6112#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6108#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {6116#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6112#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {6120#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6116#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {6124#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6120#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {6128#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6124#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6128#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {6136#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6132#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {6140#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6136#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {6144#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6140#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {6148#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6144#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {6152#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6148#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {6156#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6152#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {6160#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6156#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {5952#true} ~x~0 := 268435441; {6160#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:01:57,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret4 := main(); {5952#true} is VALID [2022-04-15 06:01:57,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-15 06:01:57,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-15 06:01:57,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {5952#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5952#true} is VALID [2022-04-15 06:01:57,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5952#true} is VALID [2022-04-15 06:01:57,087 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:01:57,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573864751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:57,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:57,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 25] total 47 [2022-04-15 06:01:57,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:57,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1443588923] [2022-04-15 06:01:57,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1443588923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:57,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:57,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:01:57,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107412089] [2022-04-15 06:01:57,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:57,088 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:01:57,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:57,088 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:01:57,107 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:01:57,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:01:57,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:57,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:01:57,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1611, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:01:57,109 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:01:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:58,135 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 06:01:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:01:58,135 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:01:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:58,140 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:01:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 06:01:58,143 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:01:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 06:01:58,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-15 06:01:58,169 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:01:58,170 INFO L225 Difference]: With dead ends: 37 [2022-04-15 06:01:58,170 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 06:01:58,171 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1069, Invalid=3353, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 06:01:58,172 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:58,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:01:58,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 06:01:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 06:01:58,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:58,201 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:01:58,201 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:01:58,201 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:01:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:58,201 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 06:01:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 06:01:58,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:58,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:58,202 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:01:58,202 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:01:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:58,202 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 06:01:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 06:01:58,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:58,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:58,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:58,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:58,203 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:01:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-15 06:01:58,203 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-15 06:01:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:58,203 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-15 06:01:58,203 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:01:58,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-15 06:01:58,238 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:01:58,238 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 06:01:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:01:58,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:58,239 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:58,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-15 06:01:58,447 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:01:58,639 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:01:58,640 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:58,640 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 39 times [2022-04-15 06:01:58,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:58,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1930007346] [2022-04-15 06:01:58,798 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:58,799 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:01:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash -744306249, now seen corresponding path program 1 times [2022-04-15 06:01:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:58,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115382968] [2022-04-15 06:01:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:58,806 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_20.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:01:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:01:58,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815678447] [2022-04-15 06:01:58,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:58,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:58,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:58,812 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:01:58,814 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:01:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:58,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:01:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:01:58,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:01:58,873 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 40 times [2022-04-15 06:01:58,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:58,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555333806] [2022-04-15 06:01:58,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:58,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:59,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:59,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {6449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6423#true} is VALID [2022-04-15 06:01:59,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 06:01:59,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-15 06:01:59,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:59,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {6449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6423#true} is VALID [2022-04-15 06:01:59,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 06:01:59,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-15 06:01:59,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret4 := main(); {6423#true} is VALID [2022-04-15 06:01:59,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#true} ~x~0 := 268435441; {6428#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:59,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {6428#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6429#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:59,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {6429#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6430#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:59,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {6430#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6431#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:59,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {6431#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6432#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:59,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {6432#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6433#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:59,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {6433#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6434#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:59,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {6434#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6435#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:59,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {6435#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6436#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:59,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {6436#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6437#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:59,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {6437#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6438#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:59,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {6438#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6439#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:59,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {6439#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6440#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:59,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {6440#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6441#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:59,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {6441#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6442#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:59,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {6442#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6443#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:59,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {6443#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6444#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:01:59,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {6444#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6445#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:01:59,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {6445#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6446#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:01:59,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {6446#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6447#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:01:59,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {6447#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6448#(and (<= (div main_~x~0 4294967296) 0) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:01:59,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {6448#(and (<= (div main_~x~0 4294967296) 0) (<= 268435401 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {6424#false} is VALID [2022-04-15 06:01:59,264 INFO L272 TraceCheckUtils]: 27: Hoare triple {6424#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6424#false} is VALID [2022-04-15 06:01:59,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {6424#false} ~cond := #in~cond; {6424#false} is VALID [2022-04-15 06:01:59,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {6424#false} assume 0 == ~cond; {6424#false} is VALID [2022-04-15 06:01:59,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-15 06:01:59,265 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:01:59,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:59,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555333806] [2022-04-15 06:01:59,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555333806] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:59,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596903760] [2022-04-15 06:01:59,265 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:59,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:59,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:59,267 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:01:59,268 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:01:59,321 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:59,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:59,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 06:01:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:59,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:59,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6423#true} is VALID [2022-04-15 06:01:59,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6423#true} is VALID [2022-04-15 06:01:59,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 06:01:59,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-15 06:01:59,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret4 := main(); {6423#true} is VALID [2022-04-15 06:01:59,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#true} ~x~0 := 268435441; {6428#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:01:59,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {6428#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6429#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:01:59,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {6429#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6430#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:01:59,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {6430#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6431#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:01:59,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {6431#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6432#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:01:59,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {6432#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6433#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:01:59,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {6433#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6434#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:01:59,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {6434#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6435#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:01:59,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {6435#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6436#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:01:59,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {6436#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6437#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:01:59,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {6437#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6438#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:01:59,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {6438#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6439#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:01:59,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {6439#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6440#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:01:59,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {6440#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6441#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:01:59,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {6441#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6442#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:01:59,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {6442#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6443#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:01:59,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {6443#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6444#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:01:59,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {6444#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6445#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:01:59,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {6445#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6446#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:01:59,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {6446#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6447#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:01:59,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {6447#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6528#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:01:59,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {6528#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {6424#false} is VALID [2022-04-15 06:01:59,659 INFO L272 TraceCheckUtils]: 27: Hoare triple {6424#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6424#false} is VALID [2022-04-15 06:01:59,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {6424#false} ~cond := #in~cond; {6424#false} is VALID [2022-04-15 06:01:59,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {6424#false} assume 0 == ~cond; {6424#false} is VALID [2022-04-15 06:01:59,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-15 06:01:59,659 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:01:59,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:00,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-15 06:02:00,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {6424#false} assume 0 == ~cond; {6424#false} is VALID [2022-04-15 06:02:00,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {6424#false} ~cond := #in~cond; {6424#false} is VALID [2022-04-15 06:02:00,489 INFO L272 TraceCheckUtils]: 27: Hoare triple {6424#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6424#false} is VALID [2022-04-15 06:02:00,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {6556#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {6424#false} is VALID [2022-04-15 06:02:00,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {6560#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6556#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:02:00,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {6564#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6560#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:02:00,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {6568#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6564#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:00,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {6572#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6568#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:00,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {6576#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6572#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:00,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {6580#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6576#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:02:00,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {6584#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6580#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:02:00,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {6588#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6584#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:00,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {6592#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6588#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:02:00,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {6596#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6592#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:02:00,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {6600#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6596#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:00,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {6604#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6600#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:00,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {6608#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6604#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:00,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {6612#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6608#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:02:00,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {6616#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6612#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:02:00,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {6620#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6616#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:02:00,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {6624#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6620#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:02:00,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {6628#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6624#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:02:00,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {6632#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6628#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:00,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {6636#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6632#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:02:00,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#true} ~x~0 := 268435441; {6636#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:02:00,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret4 := main(); {6423#true} is VALID [2022-04-15 06:02:00,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-15 06:02:00,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 06:02:00,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6423#true} is VALID [2022-04-15 06:02:00,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6423#true} is VALID [2022-04-15 06:02:00,506 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:02:00,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596903760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:00,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:00,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-15 06:02:00,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:00,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1930007346] [2022-04-15 06:02:00,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1930007346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:00,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:00,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:02:00,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294269607] [2022-04-15 06:02:00,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:00,507 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:02:00,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:00,507 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:02:00,527 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:02:00,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:02:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:00,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:02:00,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:02:00,529 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:02:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:01,628 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 06:02:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:02:01,629 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:02:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:01,629 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:02:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 06:02:01,630 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:02:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 06:02:01,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-15 06:02:01,657 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:02:01,658 INFO L225 Difference]: With dead ends: 38 [2022-04-15 06:02:01,658 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 06:02:01,659 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1137, Invalid=3285, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 06:02:01,659 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:01,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:02:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 06:02:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 06:02:01,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:01,693 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:02:01,693 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:02:01,693 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:02:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:01,694 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 06:02:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 06:02:01,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:01,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:01,694 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:02:01,694 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:02:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:01,695 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 06:02:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 06:02:01,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:01,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:01,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:01,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:01,695 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:02:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-15 06:02:01,696 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-15 06:02:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:01,696 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-15 06:02:01,696 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:02:01,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-15 06:02:01,742 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:02:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 06:02:01,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:02:01,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:01,743 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:01,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-15 06:02:01,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:02,149 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:02:02,149 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:02,150 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 41 times [2022-04-15 06:02:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:02,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2108391155] [2022-04-15 06:02:02,313 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:02,314 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash -685200905, now seen corresponding path program 1 times [2022-04-15 06:02:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:02,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973526012] [2022-04-15 06:02:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:02,322 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_21.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:02:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:02,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775995419] [2022-04-15 06:02:02,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:02,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:02,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:02,327 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:02:02,328 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:02:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:02,367 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:02,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 42 times [2022-04-15 06:02:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:02,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109757842] [2022-04-15 06:02:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:02,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:02,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {6934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6907#true} is VALID [2022-04-15 06:02:02,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-15 06:02:02,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-15 06:02:02,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {6907#true} call ULTIMATE.init(); {6934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:02,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {6934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6907#true} is VALID [2022-04-15 06:02:02,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-15 06:02:02,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-15 06:02:02,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {6907#true} call #t~ret4 := main(); {6907#true} is VALID [2022-04-15 06:02:02,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {6907#true} ~x~0 := 268435441; {6912#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:02,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {6912#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6913#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:02,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {6913#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6914#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:02,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {6914#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6915#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:02,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {6915#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6916#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:02,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {6916#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6917#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:02,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {6917#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6918#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:02,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {6918#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6919#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:02,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {6919#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6920#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:02,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {6920#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6921#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:02,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {6921#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6922#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:02,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {6922#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6923#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:02,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {6923#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6924#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:02,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {6924#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6925#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:02,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {6925#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6926#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:02,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {6926#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6927#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:02,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {6927#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6928#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:02,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {6928#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6929#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:02,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {6929#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6930#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:02,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {6930#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6931#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:02,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {6931#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6932#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:02,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {6932#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6933#(and (<= (div main_~x~0 4294967296) 0) (<= 268435399 main_~x~0))} is VALID [2022-04-15 06:02:02,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {6933#(and (<= (div main_~x~0 4294967296) 0) (<= 268435399 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {6908#false} is VALID [2022-04-15 06:02:02,898 INFO L272 TraceCheckUtils]: 28: Hoare triple {6908#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6908#false} is VALID [2022-04-15 06:02:02,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {6908#false} ~cond := #in~cond; {6908#false} is VALID [2022-04-15 06:02:02,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {6908#false} assume 0 == ~cond; {6908#false} is VALID [2022-04-15 06:02:02,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {6908#false} assume !false; {6908#false} is VALID [2022-04-15 06:02:02,898 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:02:02,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:02,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109757842] [2022-04-15 06:02:02,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109757842] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:02,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338899485] [2022-04-15 06:02:02,898 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:02:02,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:02,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:02,899 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:02:02,900 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:02:03,159 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-15 06:02:03,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:03,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 06:02:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:03,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:03,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {6907#true} call ULTIMATE.init(); {6907#true} is VALID [2022-04-15 06:02:03,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {6907#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6907#true} is VALID [2022-04-15 06:02:03,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-15 06:02:03,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-15 06:02:03,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {6907#true} call #t~ret4 := main(); {6907#true} is VALID [2022-04-15 06:02:03,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {6907#true} ~x~0 := 268435441; {6912#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:03,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {6912#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6913#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:03,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {6913#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6914#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:03,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {6914#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6915#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:03,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {6915#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6916#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:03,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {6916#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6917#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:03,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {6917#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6918#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:03,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {6918#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6919#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:03,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {6919#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6920#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:03,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {6920#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6921#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:03,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {6921#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6922#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:03,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {6922#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6923#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:03,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {6923#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6924#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:03,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {6924#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6925#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:03,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {6925#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6926#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:03,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {6926#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6927#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:03,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {6927#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6928#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:03,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {6928#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6929#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:03,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {6929#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6930#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:03,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {6930#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6931#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:03,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {6931#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {6932#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:03,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {6932#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7016#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:03,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {7016#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !(~x~0 % 4294967296 > 1); {6908#false} is VALID [2022-04-15 06:02:03,432 INFO L272 TraceCheckUtils]: 28: Hoare triple {6908#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6908#false} is VALID [2022-04-15 06:02:03,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {6908#false} ~cond := #in~cond; {6908#false} is VALID [2022-04-15 06:02:03,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {6908#false} assume 0 == ~cond; {6908#false} is VALID [2022-04-15 06:02:03,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {6908#false} assume !false; {6908#false} is VALID [2022-04-15 06:02:03,432 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:02:03,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:04,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {6908#false} assume !false; {6908#false} is VALID [2022-04-15 06:02:04,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {7035#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6908#false} is VALID [2022-04-15 06:02:04,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {7039#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7035#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:02:04,766 INFO L272 TraceCheckUtils]: 28: Hoare triple {7043#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7039#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:02:04,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {7047#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {7043#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:02:04,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {7051#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7047#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {7055#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7051#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {7059#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7055#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {7063#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7059#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {7067#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7063#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {7071#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7067#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {7075#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7071#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {7079#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7075#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {7083#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7079#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {7087#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7083#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {7091#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7087#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {7095#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7091#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {7099#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7095#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {7103#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7099#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {7107#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7103#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {7111#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7107#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {7115#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7111#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {7119#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7115#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {7123#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7119#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {7127#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7123#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {7131#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7127#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {6907#true} ~x~0 := 268435441; {7131#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:04,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {6907#true} call #t~ret4 := main(); {6907#true} is VALID [2022-04-15 06:02:04,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-15 06:02:04,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-15 06:02:04,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {6907#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6907#true} is VALID [2022-04-15 06:02:04,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {6907#true} call ULTIMATE.init(); {6907#true} is VALID [2022-04-15 06:02:04,799 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:02:04,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338899485] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:04,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:04,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 27] total 51 [2022-04-15 06:02:04,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:04,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2108391155] [2022-04-15 06:02:04,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2108391155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:04,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:04,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 06:02:04,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618088871] [2022-04-15 06:02:04,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:04,800 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:02:04,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:04,800 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:02:04,819 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:02:04,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 06:02:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 06:02:04,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1901, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:02:04,821 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:02:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:05,957 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 06:02:05,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:02:05,957 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:02:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:05,957 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:02:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 06:02:05,958 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:02:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 06:02:05,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-15 06:02:05,981 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:02:05,982 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:02:05,982 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 06:02:05,983 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1263, Invalid=3993, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 06:02:05,983 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:05,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:02:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 06:02:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 06:02:06,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:06,013 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:02:06,013 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:02:06,014 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:02:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:06,017 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 06:02:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 06:02:06,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:06,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:06,017 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:02:06,017 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:02:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:06,022 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 06:02:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 06:02:06,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:06,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:06,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:06,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:06,022 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:02:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-15 06:02:06,022 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-15 06:02:06,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:06,023 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-15 06:02:06,023 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:02:06,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-15 06:02:06,052 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:02:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 06:02:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:02:06,052 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:06,053 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:06,057 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:02:06,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:06,454 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:02:06,454 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 43 times [2022-04-15 06:02:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:06,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [529526023] [2022-04-15 06:02:06,613 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:06,614 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:06,616 INFO L85 PathProgramCache]: Analyzing trace with hash -626095561, now seen corresponding path program 1 times [2022-04-15 06:02:06,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:06,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11880179] [2022-04-15 06:02:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:06,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:06,620 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_22.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:02:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:06,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261878182] [2022-04-15 06:02:06,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:06,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:06,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:06,628 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:02:06,629 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:02:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:06,666 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:06,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 44 times [2022-04-15 06:02:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:06,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896936154] [2022-04-15 06:02:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:07,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {7438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7410#true} is VALID [2022-04-15 06:02:07,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-15 06:02:07,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-15 06:02:07,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {7410#true} call ULTIMATE.init(); {7438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:07,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {7438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7410#true} is VALID [2022-04-15 06:02:07,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-15 06:02:07,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-15 06:02:07,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {7410#true} call #t~ret4 := main(); {7410#true} is VALID [2022-04-15 06:02:07,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {7410#true} ~x~0 := 268435441; {7415#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:07,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {7415#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7416#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:07,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {7416#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7417#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:07,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {7417#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7418#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:07,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {7418#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7419#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:07,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {7419#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7420#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:07,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {7420#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7421#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:07,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {7421#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7422#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:07,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {7422#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7423#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:07,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {7423#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7424#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:07,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {7424#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7425#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:07,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {7425#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7426#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:07,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {7426#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7427#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:07,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {7427#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7428#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:07,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {7428#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7429#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:07,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {7429#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7430#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:07,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {7430#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7431#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:07,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {7431#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7432#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:07,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {7432#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7433#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:07,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {7433#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7434#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:07,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {7434#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7435#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:07,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {7435#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7436#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:07,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {7436#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7437#(and (<= (div main_~x~0 4294967296) 0) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:07,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {7437#(and (<= (div main_~x~0 4294967296) 0) (<= 268435397 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {7411#false} is VALID [2022-04-15 06:02:07,083 INFO L272 TraceCheckUtils]: 29: Hoare triple {7411#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7411#false} is VALID [2022-04-15 06:02:07,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {7411#false} ~cond := #in~cond; {7411#false} is VALID [2022-04-15 06:02:07,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {7411#false} assume 0 == ~cond; {7411#false} is VALID [2022-04-15 06:02:07,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2022-04-15 06:02:07,083 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:02:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:07,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896936154] [2022-04-15 06:02:07,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896936154] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:07,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602637043] [2022-04-15 06:02:07,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:02:07,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:07,084 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:02:07,085 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:02:07,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:02:07,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:07,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 06:02:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:07,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:07,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {7410#true} call ULTIMATE.init(); {7410#true} is VALID [2022-04-15 06:02:07,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7410#true} is VALID [2022-04-15 06:02:07,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-15 06:02:07,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-15 06:02:07,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {7410#true} call #t~ret4 := main(); {7410#true} is VALID [2022-04-15 06:02:07,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {7410#true} ~x~0 := 268435441; {7415#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:07,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {7415#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7416#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:07,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {7416#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7417#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:07,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {7417#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7418#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:07,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {7418#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7419#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:07,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {7419#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7420#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:07,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {7420#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7421#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:07,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {7421#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7422#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:07,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {7422#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7423#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:07,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {7423#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7424#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:07,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {7424#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7425#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:07,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {7425#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7426#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:07,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {7426#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7427#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:07,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {7427#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7428#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:07,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {7428#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7429#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:07,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {7429#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7430#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:07,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {7430#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7431#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:07,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {7431#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7432#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:07,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {7432#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7433#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:07,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {7433#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7434#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:07,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {7434#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7435#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:07,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {7435#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7436#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:07,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {7436#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7523#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:07,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {7523#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {7411#false} is VALID [2022-04-15 06:02:07,417 INFO L272 TraceCheckUtils]: 29: Hoare triple {7411#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7411#false} is VALID [2022-04-15 06:02:07,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {7411#false} ~cond := #in~cond; {7411#false} is VALID [2022-04-15 06:02:07,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {7411#false} assume 0 == ~cond; {7411#false} is VALID [2022-04-15 06:02:07,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2022-04-15 06:02:07,417 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:02:07,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:08,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2022-04-15 06:02:08,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {7542#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7411#false} is VALID [2022-04-15 06:02:08,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {7546#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7542#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:02:08,834 INFO L272 TraceCheckUtils]: 29: Hoare triple {7550#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7546#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:02:08,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {7554#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {7550#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:02:08,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {7558#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7554#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {7562#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7558#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {7566#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7562#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {7570#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7566#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {7574#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7570#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {7578#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7574#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {7582#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7578#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {7586#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7582#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {7590#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7586#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {7594#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7590#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {7598#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7594#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {7602#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7598#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {7606#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7602#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {7610#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7606#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {7614#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7610#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {7618#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7614#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {7622#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7618#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {7626#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7622#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {7630#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7626#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {7634#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7630#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {7638#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7634#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {7642#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7638#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {7410#true} ~x~0 := 268435441; {7642#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:08,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {7410#true} call #t~ret4 := main(); {7410#true} is VALID [2022-04-15 06:02:08,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-15 06:02:08,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-15 06:02:08,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7410#true} is VALID [2022-04-15 06:02:08,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {7410#true} call ULTIMATE.init(); {7410#true} is VALID [2022-04-15 06:02:08,874 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:02:08,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602637043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:08,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:08,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 28] total 53 [2022-04-15 06:02:08,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:08,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [529526023] [2022-04-15 06:02:08,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [529526023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:08,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:08,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:02:08,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041268607] [2022-04-15 06:02:08,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:08,875 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:02:08,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:08,875 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:02:08,895 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:02:08,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:02:08,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:08,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:02:08,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=2055, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:02:08,897 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:02:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:10,401 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 06:02:10,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:02:10,403 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:02:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:10,404 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:02:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 06:02:10,405 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:02:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 06:02:10,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-15 06:02:10,438 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:02:10,439 INFO L225 Difference]: With dead ends: 40 [2022-04-15 06:02:10,439 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:02:10,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1366, Invalid=4334, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 06:02:10,440 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:10,440 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.6s Time] [2022-04-15 06:02:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:02:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 06:02:10,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:10,472 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:02:10,472 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:02:10,472 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:02:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:10,472 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 06:02:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 06:02:10,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:10,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:10,473 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:02:10,473 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:02:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:10,473 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 06:02:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 06:02:10,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:10,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:10,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:10,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:10,474 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:02:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-15 06:02:10,474 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-15 06:02:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:10,474 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-15 06:02:10,475 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:02:10,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-15 06:02:10,503 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:02:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 06:02:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:02:10,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:10,504 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:10,509 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:02:10,723 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:02:10,905 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:02:10,905 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:10,905 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 45 times [2022-04-15 06:02:10,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:10,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1089594481] [2022-04-15 06:02:11,052 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:11,053 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:11,055 INFO L85 PathProgramCache]: Analyzing trace with hash -566990217, now seen corresponding path program 1 times [2022-04-15 06:02:11,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:11,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012574658] [2022-04-15 06:02:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:11,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:11,061 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_23.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:02:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:11,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564558530] [2022-04-15 06:02:11,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:11,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:11,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:11,068 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:02:11,076 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:02:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:11,124 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:11,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:11,133 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 46 times [2022-04-15 06:02:11,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:11,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138865450] [2022-04-15 06:02:11,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:11,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:11,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:11,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {7958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7929#true} is VALID [2022-04-15 06:02:11,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-15 06:02:11,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-15 06:02:11,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {7929#true} call ULTIMATE.init(); {7958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:11,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {7958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7929#true} is VALID [2022-04-15 06:02:11,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-15 06:02:11,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-15 06:02:11,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {7929#true} call #t~ret4 := main(); {7929#true} is VALID [2022-04-15 06:02:11,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {7929#true} ~x~0 := 268435441; {7934#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:11,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {7934#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7935#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:11,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {7935#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7936#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:11,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {7936#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7937#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:11,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {7937#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7938#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:11,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {7938#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7939#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:11,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {7939#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7940#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:11,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {7940#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7941#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:11,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {7941#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7942#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:11,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {7942#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7943#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:11,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {7943#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7944#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:11,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {7944#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7945#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:11,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {7945#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7946#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:11,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {7946#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7947#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:11,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {7947#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7948#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:11,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {7948#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7949#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:11,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {7949#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7950#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:11,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {7950#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7951#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:11,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {7951#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7952#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:11,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {7952#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7953#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:11,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {7953#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7954#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:11,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {7954#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7955#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:11,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {7955#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7956#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:11,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {7956#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7957#(and (<= (div main_~x~0 4294967296) 0) (<= 268435395 main_~x~0))} is VALID [2022-04-15 06:02:11,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {7957#(and (<= (div main_~x~0 4294967296) 0) (<= 268435395 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {7930#false} is VALID [2022-04-15 06:02:11,596 INFO L272 TraceCheckUtils]: 30: Hoare triple {7930#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7930#false} is VALID [2022-04-15 06:02:11,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {7930#false} ~cond := #in~cond; {7930#false} is VALID [2022-04-15 06:02:11,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {7930#false} assume 0 == ~cond; {7930#false} is VALID [2022-04-15 06:02:11,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {7930#false} assume !false; {7930#false} is VALID [2022-04-15 06:02:11,596 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:02:11,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:11,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138865450] [2022-04-15 06:02:11,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138865450] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:11,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560017959] [2022-04-15 06:02:11,597 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:02:11,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:11,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:11,598 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:02:11,599 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:02:11,658 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:02:11,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:11,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 06:02:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:11,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:12,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {7929#true} call ULTIMATE.init(); {7929#true} is VALID [2022-04-15 06:02:12,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {7929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7929#true} is VALID [2022-04-15 06:02:12,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-15 06:02:12,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-15 06:02:12,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {7929#true} call #t~ret4 := main(); {7929#true} is VALID [2022-04-15 06:02:12,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {7929#true} ~x~0 := 268435441; {7934#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:12,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {7934#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7935#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:12,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {7935#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7936#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:12,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {7936#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7937#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:12,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {7937#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7938#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:12,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {7938#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7939#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:12,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {7939#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7940#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:12,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {7940#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7941#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:12,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {7941#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7942#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:12,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {7942#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7943#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:12,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {7943#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7944#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:12,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {7944#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7945#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:12,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {7945#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7946#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:12,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {7946#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7947#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:12,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {7947#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7948#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:12,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {7948#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7949#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:12,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {7949#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7950#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:12,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {7950#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7951#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:12,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {7951#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7952#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:12,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {7952#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7953#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:12,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {7953#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7954#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:12,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {7954#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7955#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:12,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {7955#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {7956#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:12,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {7956#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8046#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:12,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {8046#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !(~x~0 % 4294967296 > 1); {7930#false} is VALID [2022-04-15 06:02:12,107 INFO L272 TraceCheckUtils]: 30: Hoare triple {7930#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7930#false} is VALID [2022-04-15 06:02:12,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {7930#false} ~cond := #in~cond; {7930#false} is VALID [2022-04-15 06:02:12,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {7930#false} assume 0 == ~cond; {7930#false} is VALID [2022-04-15 06:02:12,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {7930#false} assume !false; {7930#false} is VALID [2022-04-15 06:02:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:02:12,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:13,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {7930#false} assume !false; {7930#false} is VALID [2022-04-15 06:02:13,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {7930#false} assume 0 == ~cond; {7930#false} is VALID [2022-04-15 06:02:13,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {7930#false} ~cond := #in~cond; {7930#false} is VALID [2022-04-15 06:02:13,465 INFO L272 TraceCheckUtils]: 30: Hoare triple {7930#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7930#false} is VALID [2022-04-15 06:02:13,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {8074#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {7930#false} is VALID [2022-04-15 06:02:13,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {8078#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8074#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:02:13,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {8082#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8078#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:02:13,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {8086#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8082#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:13,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {8090#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8086#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:13,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {8094#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8090#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:13,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {8098#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8094#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:02:13,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {8102#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8098#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:02:13,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {8106#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8102#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:13,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {8110#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8106#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:02:13,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {8114#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8110#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:02:13,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {8118#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8114#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:13,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {8122#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8118#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:13,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {8126#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8122#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:13,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {8130#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8126#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:02:13,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {8134#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8130#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:02:13,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {8138#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8134#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:02:13,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {8142#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8138#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:02:13,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {8146#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8142#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:02:13,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {8150#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8146#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:13,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {8154#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8150#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:02:13,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {8158#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8154#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:02:13,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {8162#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8158#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:13,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {8166#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8162#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:02:13,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {7929#true} ~x~0 := 268435441; {8166#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:13,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {7929#true} call #t~ret4 := main(); {7929#true} is VALID [2022-04-15 06:02:13,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-15 06:02:13,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-15 06:02:13,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {7929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7929#true} is VALID [2022-04-15 06:02:13,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {7929#true} call ULTIMATE.init(); {7929#true} is VALID [2022-04-15 06:02:13,488 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:02:13,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560017959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:13,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:13,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-15 06:02:13,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:13,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1089594481] [2022-04-15 06:02:13,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1089594481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:13,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:13,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 06:02:13,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985387209] [2022-04-15 06:02:13,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:13,489 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:02:13,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:13,489 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:02:13,510 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:02:13,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 06:02:13,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:13,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 06:02:13,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 06:02:13,511 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:02:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:15,058 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 06:02:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:02:15,059 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:02:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:15,059 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:02:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 06:02:15,060 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:02:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 06:02:15,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-15 06:02:15,098 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:02:15,099 INFO L225 Difference]: With dead ends: 41 [2022-04-15 06:02:15,099 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 06:02:15,100 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1443, Invalid=4257, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 06:02:15,100 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:15,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:02:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 06:02:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 06:02:15,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:15,141 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:02:15,141 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:02:15,141 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:02:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:15,142 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 06:02:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 06:02:15,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:15,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:15,142 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:02:15,142 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:02:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:15,142 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 06:02:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 06:02:15,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:15,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:15,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:15,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:15,143 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:02:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-15 06:02:15,143 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-15 06:02:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:15,144 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-15 06:02:15,144 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:02:15,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-15 06:02:15,170 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:02:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 06:02:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:02:15,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:15,171 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:15,176 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:02:15,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-15 06:02:15,576 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:02:15,576 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:15,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 47 times [2022-04-15 06:02:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:15,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389792912] [2022-04-15 06:02:15,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:02:15,715 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:15,717 INFO L85 PathProgramCache]: Analyzing trace with hash -507884873, now seen corresponding path program 1 times [2022-04-15 06:02:15,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:15,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714191461] [2022-04-15 06:02:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:15,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:15,723 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_24.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:02:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:15,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [627213204] [2022-04-15 06:02:15,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:15,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:15,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:15,740 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:02:15,741 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:02:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:15,780 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:15,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:15,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 48 times [2022-04-15 06:02:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:15,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248070796] [2022-04-15 06:02:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:15,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:16,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:16,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {8491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8461#true} is VALID [2022-04-15 06:02:16,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-15 06:02:16,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-15 06:02:16,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {8461#true} call ULTIMATE.init(); {8491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:16,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {8491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8461#true} is VALID [2022-04-15 06:02:16,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-15 06:02:16,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-15 06:02:16,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {8461#true} call #t~ret4 := main(); {8461#true} is VALID [2022-04-15 06:02:16,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {8461#true} ~x~0 := 268435441; {8466#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:16,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {8466#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8467#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:16,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {8467#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8468#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:16,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {8468#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8469#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:16,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {8469#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8470#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:16,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {8470#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8471#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:16,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {8471#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8472#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:16,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {8472#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8473#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:16,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {8473#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8474#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:16,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {8474#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8475#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:16,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {8475#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8476#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:16,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {8476#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8477#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:16,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {8477#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8478#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:16,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {8478#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8479#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:16,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {8479#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8480#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:16,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {8480#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8481#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:16,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {8481#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8482#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:16,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {8482#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8483#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:16,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {8483#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8484#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:16,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {8484#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8485#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:16,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {8485#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8486#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:16,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {8486#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8487#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:16,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {8487#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8488#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:16,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {8488#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8489#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:16,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {8489#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8490#(and (<= (div main_~x~0 4294967296) 0) (<= 268435393 main_~x~0))} is VALID [2022-04-15 06:02:16,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {8490#(and (<= (div main_~x~0 4294967296) 0) (<= 268435393 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {8462#false} is VALID [2022-04-15 06:02:16,282 INFO L272 TraceCheckUtils]: 31: Hoare triple {8462#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8462#false} is VALID [2022-04-15 06:02:16,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {8462#false} ~cond := #in~cond; {8462#false} is VALID [2022-04-15 06:02:16,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {8462#false} assume 0 == ~cond; {8462#false} is VALID [2022-04-15 06:02:16,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {8462#false} assume !false; {8462#false} is VALID [2022-04-15 06:02:16,283 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:02:16,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:16,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248070796] [2022-04-15 06:02:16,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248070796] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:16,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424142093] [2022-04-15 06:02:16,283 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:02:16,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:16,284 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:02:16,285 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:02:16,716 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 06:02:16,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:16,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 06:02:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:16,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:16,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {8461#true} call ULTIMATE.init(); {8461#true} is VALID [2022-04-15 06:02:16,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {8461#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8461#true} is VALID [2022-04-15 06:02:16,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-15 06:02:16,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-15 06:02:16,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {8461#true} call #t~ret4 := main(); {8461#true} is VALID [2022-04-15 06:02:16,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {8461#true} ~x~0 := 268435441; {8466#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:16,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {8466#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8467#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:16,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {8467#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8468#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:16,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {8468#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8469#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:16,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {8469#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8470#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:16,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {8470#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8471#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:16,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {8471#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8472#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:16,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {8472#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8473#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:16,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {8473#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8474#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:16,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {8474#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8475#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:16,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {8475#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8476#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:17,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {8476#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8477#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:17,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {8477#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8478#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:17,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {8478#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8479#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:17,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {8479#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8480#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:17,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {8480#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8481#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:17,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {8481#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8482#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:17,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {8482#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8483#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:17,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {8483#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8484#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:17,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {8484#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8485#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:17,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {8485#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8486#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:17,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {8486#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8487#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:17,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {8487#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8488#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:17,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {8488#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8489#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:17,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {8489#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8582#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:17,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {8582#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !(~x~0 % 4294967296 > 1); {8462#false} is VALID [2022-04-15 06:02:17,006 INFO L272 TraceCheckUtils]: 31: Hoare triple {8462#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8462#false} is VALID [2022-04-15 06:02:17,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {8462#false} ~cond := #in~cond; {8462#false} is VALID [2022-04-15 06:02:17,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {8462#false} assume 0 == ~cond; {8462#false} is VALID [2022-04-15 06:02:17,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {8462#false} assume !false; {8462#false} is VALID [2022-04-15 06:02:17,007 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:02:17,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:18,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {8462#false} assume !false; {8462#false} is VALID [2022-04-15 06:02:18,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {8601#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8462#false} is VALID [2022-04-15 06:02:18,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {8605#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8601#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:02:18,554 INFO L272 TraceCheckUtils]: 31: Hoare triple {8609#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8605#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:02:18,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {8613#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {8609#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:02:18,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {8617#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8613#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {8621#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8617#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {8625#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8621#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {8629#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8625#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {8633#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8629#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {8637#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8633#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {8641#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8637#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {8645#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8641#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {8649#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8645#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {8653#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8649#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {8657#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8653#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {8661#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8657#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {8665#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8661#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {8669#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8665#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {8673#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8669#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {8677#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8673#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {8681#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8677#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {8685#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8681#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {8689#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8685#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {8693#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8689#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {8697#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8693#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {8701#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8697#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {8705#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8701#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {8709#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {8705#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {8461#true} ~x~0 := 268435441; {8709#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:18,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {8461#true} call #t~ret4 := main(); {8461#true} is VALID [2022-04-15 06:02:18,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-15 06:02:18,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-15 06:02:18,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {8461#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8461#true} is VALID [2022-04-15 06:02:18,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {8461#true} call ULTIMATE.init(); {8461#true} is VALID [2022-04-15 06:02:18,585 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:02:18,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424142093] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:18,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:18,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 30] total 57 [2022-04-15 06:02:18,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:18,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389792912] [2022-04-15 06:02:18,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389792912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:18,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:18,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:02:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265642040] [2022-04-15 06:02:18,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:18,586 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:02:18,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:18,587 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:02:18,643 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:02:18,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:02:18,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:18,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:02:18,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2381, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:02:18,645 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:02:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:20,101 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 06:02:20,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:02:20,101 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:02:20,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:20,101 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:02:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 06:02:20,102 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:02:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 06:02:20,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-15 06:02:20,143 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:02:20,143 INFO L225 Difference]: With dead ends: 42 [2022-04-15 06:02:20,143 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 06:02:20,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1584, Invalid=5058, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:02:20,145 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:20,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:02:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 06:02:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 06:02:20,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:20,187 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:02:20,187 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:02:20,188 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:02:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:20,188 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 06:02:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 06:02:20,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:20,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:20,188 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:02:20,189 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:02:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:20,189 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 06:02:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 06:02:20,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:20,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:20,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:20,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:20,189 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:02:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-15 06:02:20,190 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-15 06:02:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:20,190 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-15 06:02:20,190 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:02:20,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-15 06:02:20,228 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:02:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 06:02:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 06:02:20,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:20,228 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:20,247 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:02:20,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:20,629 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:02:20,629 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:20,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 49 times [2022-04-15 06:02:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:20,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1380123532] [2022-04-15 06:02:20,770 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:20,771 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:20,773 INFO L85 PathProgramCache]: Analyzing trace with hash -448779529, now seen corresponding path program 1 times [2022-04-15 06:02:20,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:20,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655331272] [2022-04-15 06:02:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:20,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:20,780 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_25.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:02:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:20,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619678] [2022-04-15 06:02:20,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:20,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:20,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:20,785 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:02:20,787 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:02:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:20,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:20,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 50 times [2022-04-15 06:02:20,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:20,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062575259] [2022-04-15 06:02:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:21,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:21,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {9043#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9012#true} is VALID [2022-04-15 06:02:21,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-15 06:02:21,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-15 06:02:21,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {9012#true} call ULTIMATE.init(); {9043#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:21,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {9043#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9012#true} is VALID [2022-04-15 06:02:21,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-15 06:02:21,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-15 06:02:21,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {9012#true} call #t~ret4 := main(); {9012#true} is VALID [2022-04-15 06:02:21,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {9012#true} ~x~0 := 268435441; {9017#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:21,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {9017#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9018#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:21,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {9018#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9019#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:21,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {9019#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9020#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:21,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {9020#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9021#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:21,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {9021#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9022#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:21,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {9022#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9023#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:21,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {9023#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9024#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:21,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {9024#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9025#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:21,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {9025#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9026#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:21,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {9026#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9027#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:21,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {9027#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9028#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:21,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {9028#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9029#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:21,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {9029#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9030#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:21,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {9030#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9031#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:21,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {9031#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9032#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:21,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {9032#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9033#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:21,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {9033#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9034#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:21,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {9034#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9035#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:21,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {9035#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9036#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:21,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {9036#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9037#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:21,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {9037#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9038#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:21,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {9038#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9039#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:21,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {9039#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9040#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:21,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {9040#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9041#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:21,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {9041#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9042#(and (<= (div main_~x~0 4294967296) 0) (<= 268435391 main_~x~0))} is VALID [2022-04-15 06:02:21,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {9042#(and (<= (div main_~x~0 4294967296) 0) (<= 268435391 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {9013#false} is VALID [2022-04-15 06:02:21,308 INFO L272 TraceCheckUtils]: 32: Hoare triple {9013#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9013#false} is VALID [2022-04-15 06:02:21,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {9013#false} ~cond := #in~cond; {9013#false} is VALID [2022-04-15 06:02:21,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {9013#false} assume 0 == ~cond; {9013#false} is VALID [2022-04-15 06:02:21,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {9013#false} assume !false; {9013#false} is VALID [2022-04-15 06:02:21,308 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:02:21,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:21,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062575259] [2022-04-15 06:02:21,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062575259] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:21,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031498205] [2022-04-15 06:02:21,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:02:21,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:21,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:21,309 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:02:21,310 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:02:21,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:02:21,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:21,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 06:02:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:21,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:21,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {9012#true} call ULTIMATE.init(); {9012#true} is VALID [2022-04-15 06:02:21,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9012#true} is VALID [2022-04-15 06:02:21,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-15 06:02:21,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-15 06:02:21,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {9012#true} call #t~ret4 := main(); {9012#true} is VALID [2022-04-15 06:02:21,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {9012#true} ~x~0 := 268435441; {9017#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:21,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {9017#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9018#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:21,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {9018#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9019#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:21,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {9019#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9020#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:21,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {9020#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9021#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:21,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {9021#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9022#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:21,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {9022#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9023#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:21,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {9023#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9024#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:21,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {9024#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9025#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:21,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {9025#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9026#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:21,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {9026#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9027#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:21,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {9027#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9028#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:21,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {9028#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9029#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:21,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {9029#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9030#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:21,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {9030#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9031#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:21,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {9031#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9032#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:21,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {9032#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9033#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:21,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {9033#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9034#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:21,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {9034#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9035#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:21,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {9035#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9036#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:21,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {9036#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9037#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:21,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {9037#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9038#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:21,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {9038#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9039#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:21,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {9039#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9040#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:21,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {9040#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9041#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:21,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {9041#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9137#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:21,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {9137#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !(~x~0 % 4294967296 > 1); {9013#false} is VALID [2022-04-15 06:02:21,755 INFO L272 TraceCheckUtils]: 32: Hoare triple {9013#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9013#false} is VALID [2022-04-15 06:02:21,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {9013#false} ~cond := #in~cond; {9013#false} is VALID [2022-04-15 06:02:21,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {9013#false} assume 0 == ~cond; {9013#false} is VALID [2022-04-15 06:02:21,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {9013#false} assume !false; {9013#false} is VALID [2022-04-15 06:02:21,755 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:02:21,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:22,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {9013#false} assume !false; {9013#false} is VALID [2022-04-15 06:02:22,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {9013#false} assume 0 == ~cond; {9013#false} is VALID [2022-04-15 06:02:22,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {9013#false} ~cond := #in~cond; {9013#false} is VALID [2022-04-15 06:02:22,884 INFO L272 TraceCheckUtils]: 32: Hoare triple {9013#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9013#false} is VALID [2022-04-15 06:02:22,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {9165#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {9013#false} is VALID [2022-04-15 06:02:22,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {9169#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9165#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:02:22,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {9173#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9169#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:02:22,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {9177#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9173#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:22,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {9181#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9177#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:22,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {9185#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9181#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:22,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {9189#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9185#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:02:22,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {9193#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9189#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:02:22,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {9197#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9193#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:22,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {9201#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9197#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:02:22,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {9205#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9201#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:02:22,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {9209#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9205#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:22,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {9213#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9209#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:22,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {9217#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9213#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:22,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {9221#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9217#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:02:22,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {9225#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9221#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:02:22,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {9229#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9225#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:02:22,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {9233#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9229#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:02:22,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {9237#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9233#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:02:22,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {9241#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9237#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:22,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {9245#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9241#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:02:22,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {9249#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9245#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:02:22,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {9253#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9249#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:22,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {9257#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9253#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:02:22,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {9261#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9257#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:22,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {9265#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9261#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:02:22,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {9012#true} ~x~0 := 268435441; {9265#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:22,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {9012#true} call #t~ret4 := main(); {9012#true} is VALID [2022-04-15 06:02:22,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-15 06:02:22,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-15 06:02:22,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9012#true} is VALID [2022-04-15 06:02:22,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {9012#true} call ULTIMATE.init(); {9012#true} is VALID [2022-04-15 06:02:22,916 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:02:22,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031498205] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:22,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:22,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 06:02:22,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:22,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1380123532] [2022-04-15 06:02:22,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1380123532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:22,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:22,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 06:02:22,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669569249] [2022-04-15 06:02:22,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:22,917 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:02:22,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:22,917 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:02:22,938 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:02:22,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 06:02:22,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:22,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 06:02:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=2243, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 06:02:22,940 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:02:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:24,534 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 06:02:24,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:02:24,534 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:02:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:24,534 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:02:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 06:02:24,535 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:02:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 06:02:24,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-15 06:02:24,571 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:02:24,571 INFO L225 Difference]: With dead ends: 43 [2022-04-15 06:02:24,571 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 06:02:24,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1667, Invalid=4975, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:02:24,572 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:24,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:02:24,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 06:02:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 06:02:24,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:24,611 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:02:24,611 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:02:24,611 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:02:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:24,611 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 06:02:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 06:02:24,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:24,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:24,612 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:02:24,612 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:02:24,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:24,612 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 06:02:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 06:02:24,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:24,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:24,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:24,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:24,613 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:02:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-15 06:02:24,613 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-15 06:02:24,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:24,613 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-15 06:02:24,613 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:02:24,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-15 06:02:24,643 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:02:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 06:02:24,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:02:24,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:24,643 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:24,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-04-15 06:02:24,848 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:02:25,044 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:02:25,044 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 51 times [2022-04-15 06:02:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:25,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039698462] [2022-04-15 06:02:25,184 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:25,187 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash -389674185, now seen corresponding path program 1 times [2022-04-15 06:02:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:25,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84990866] [2022-04-15 06:02:25,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:25,193 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_26.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:02:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:25,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241676768] [2022-04-15 06:02:25,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:25,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:25,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:25,198 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:02:25,215 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:02:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:25,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:25,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 52 times [2022-04-15 06:02:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:25,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118436380] [2022-04-15 06:02:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:25,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:25,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:25,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {9608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9576#true} is VALID [2022-04-15 06:02:25,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-15 06:02:25,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-15 06:02:25,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {9576#true} call ULTIMATE.init(); {9608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:25,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {9608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9576#true} is VALID [2022-04-15 06:02:25,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-15 06:02:25,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-15 06:02:25,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {9576#true} call #t~ret4 := main(); {9576#true} is VALID [2022-04-15 06:02:25,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {9576#true} ~x~0 := 268435441; {9581#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:25,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {9581#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9582#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:25,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {9582#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9583#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:25,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {9583#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9584#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:25,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {9584#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9585#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:25,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {9585#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9586#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:25,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {9586#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9587#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:25,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {9587#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9588#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:25,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {9588#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9589#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:25,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {9589#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9590#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:25,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {9590#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9591#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:25,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {9591#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9592#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:25,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {9592#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9593#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:25,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {9593#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9594#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:25,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {9594#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9595#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:25,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {9595#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9596#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:25,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {9596#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9597#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:25,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {9597#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9598#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:25,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {9598#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9599#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:25,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {9599#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9600#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:25,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {9600#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9601#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:25,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {9601#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9602#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:25,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {9602#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9603#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:25,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {9603#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9604#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:25,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {9604#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9605#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:25,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {9605#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9606#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:25,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {9606#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9607#(and (<= (div main_~x~0 4294967296) 0) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:25,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {9607#(and (<= (div main_~x~0 4294967296) 0) (<= 268435389 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {9577#false} is VALID [2022-04-15 06:02:25,793 INFO L272 TraceCheckUtils]: 33: Hoare triple {9577#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9577#false} is VALID [2022-04-15 06:02:25,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {9577#false} ~cond := #in~cond; {9577#false} is VALID [2022-04-15 06:02:25,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {9577#false} assume 0 == ~cond; {9577#false} is VALID [2022-04-15 06:02:25,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {9577#false} assume !false; {9577#false} is VALID [2022-04-15 06:02:25,793 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:02:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:25,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118436380] [2022-04-15 06:02:25,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118436380] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:25,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964145594] [2022-04-15 06:02:25,794 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:02:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:25,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:25,795 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:02:25,796 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:02:25,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:02:25,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:25,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 06:02:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:25,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:26,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {9576#true} call ULTIMATE.init(); {9576#true} is VALID [2022-04-15 06:02:26,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {9576#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9576#true} is VALID [2022-04-15 06:02:26,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-15 06:02:26,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-15 06:02:26,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {9576#true} call #t~ret4 := main(); {9576#true} is VALID [2022-04-15 06:02:26,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {9576#true} ~x~0 := 268435441; {9581#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:26,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {9581#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9582#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:26,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {9582#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9583#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:26,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {9583#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9584#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:26,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {9584#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9585#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:26,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {9585#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9586#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:26,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {9586#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9587#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:26,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {9587#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9588#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:26,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {9588#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9589#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:26,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {9589#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9590#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:26,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {9590#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9591#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:26,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {9591#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9592#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:26,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {9592#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9593#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:26,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {9593#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9594#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:26,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {9594#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9595#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:26,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {9595#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9596#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:26,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {9596#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9597#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:26,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {9597#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9598#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:26,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {9598#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9599#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:26,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {9599#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9600#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:26,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {9600#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9601#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:26,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {9601#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9602#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:26,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {9602#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9603#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:26,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {9603#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9604#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:26,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {9604#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9605#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:26,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {9605#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9606#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:26,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {9606#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9705#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:26,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {9705#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {9577#false} is VALID [2022-04-15 06:02:26,270 INFO L272 TraceCheckUtils]: 33: Hoare triple {9577#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9577#false} is VALID [2022-04-15 06:02:26,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {9577#false} ~cond := #in~cond; {9577#false} is VALID [2022-04-15 06:02:26,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {9577#false} assume 0 == ~cond; {9577#false} is VALID [2022-04-15 06:02:26,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {9577#false} assume !false; {9577#false} is VALID [2022-04-15 06:02:26,270 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:02:26,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:27,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {9577#false} assume !false; {9577#false} is VALID [2022-04-15 06:02:27,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {9577#false} assume 0 == ~cond; {9577#false} is VALID [2022-04-15 06:02:27,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {9577#false} ~cond := #in~cond; {9577#false} is VALID [2022-04-15 06:02:27,519 INFO L272 TraceCheckUtils]: 33: Hoare triple {9577#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9577#false} is VALID [2022-04-15 06:02:27,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {9733#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {9577#false} is VALID [2022-04-15 06:02:27,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {9737#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9733#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:02:27,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {9741#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9737#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:02:27,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {9745#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9741#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:27,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {9749#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9745#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:27,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {9753#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9749#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:27,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {9757#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9753#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:02:27,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {9761#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9757#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:02:27,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {9765#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9761#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:27,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {9769#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9765#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:02:27,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {9773#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9769#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:02:27,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {9777#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9773#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:27,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {9781#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9777#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:27,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {9785#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9781#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:27,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {9789#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9785#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:02:27,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {9793#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9789#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:02:27,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {9797#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9793#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:02:27,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {9801#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9797#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:02:27,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {9805#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9801#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:02:27,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {9809#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9805#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:27,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {9813#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9809#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:02:27,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {9817#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9813#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:02:27,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {9821#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9817#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:27,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {9825#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9821#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:02:27,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {9829#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9825#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:27,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {9833#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9829#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:02:27,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {9837#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {9833#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:27,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {9576#true} ~x~0 := 268435441; {9837#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:02:27,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {9576#true} call #t~ret4 := main(); {9576#true} is VALID [2022-04-15 06:02:27,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-15 06:02:27,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-15 06:02:27,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {9576#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9576#true} is VALID [2022-04-15 06:02:27,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {9576#true} call ULTIMATE.init(); {9576#true} is VALID [2022-04-15 06:02:27,542 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:02:27,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964145594] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:27,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:27,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-15 06:02:27,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:27,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039698462] [2022-04-15 06:02:27,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039698462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:27,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:27,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:02:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795514727] [2022-04-15 06:02:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:27,543 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:02:27,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:27,543 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:02:27,567 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:02:27,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:02:27,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:27,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:02:27,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=2410, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:02:27,569 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:02:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:29,352 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 06:02:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:02:29,352 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:02:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:29,353 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:02:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 06:02:29,353 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:02:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 06:02:29,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-15 06:02:29,387 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:29,388 INFO L225 Difference]: With dead ends: 44 [2022-04-15 06:02:29,388 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 06:02:29,389 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1785, Invalid=5355, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 06:02:29,389 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:29,389 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:02:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 06:02:29,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 06:02:29,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:29,426 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:02:29,426 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:02:29,426 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:02:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:29,427 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 06:02:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 06:02:29,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:29,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:29,427 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:02:29,427 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:02:29,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:29,428 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 06:02:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 06:02:29,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:29,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:29,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:29,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:29,428 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:02:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-15 06:02:29,429 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-15 06:02:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:29,429 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-15 06:02:29,429 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:02:29,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-15 06:02:29,462 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:02:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 06:02:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 06:02:29,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:29,463 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:29,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-04-15 06:02:29,677 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:02:29,872 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:02:29,872 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 53 times [2022-04-15 06:02:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:29,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244778345] [2022-04-15 06:02:30,017 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:30,019 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash -330568841, now seen corresponding path program 1 times [2022-04-15 06:02:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:30,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958369868] [2022-04-15 06:02:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:30,026 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_27.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:02:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:30,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281029683] [2022-04-15 06:02:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:30,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:30,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:30,031 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:02:30,032 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:02:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:30,070 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:30,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:30,079 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 54 times [2022-04-15 06:02:30,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:30,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047755210] [2022-04-15 06:02:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:30,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:30,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {10189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10156#true} is VALID [2022-04-15 06:02:30,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-15 06:02:30,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-15 06:02:30,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {10156#true} call ULTIMATE.init(); {10189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:30,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {10189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10156#true} is VALID [2022-04-15 06:02:30,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-15 06:02:30,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-15 06:02:30,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {10156#true} call #t~ret4 := main(); {10156#true} is VALID [2022-04-15 06:02:30,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {10156#true} ~x~0 := 268435441; {10161#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:30,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {10161#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10162#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:30,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {10162#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10163#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:30,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {10163#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10164#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:30,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {10164#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10165#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:30,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {10165#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10166#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:30,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {10166#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10167#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:30,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {10167#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10168#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:30,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {10168#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10169#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:30,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {10169#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10170#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:30,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {10170#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10171#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:30,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {10171#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10172#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:30,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {10172#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10173#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:30,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {10173#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10174#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:30,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {10174#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10175#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:30,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {10175#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10176#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:30,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {10176#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10177#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:30,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {10177#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10178#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:30,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {10178#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10179#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:30,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {10179#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10180#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:30,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {10180#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10181#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:30,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {10181#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10182#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:30,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {10182#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10183#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:30,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {10183#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10184#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:30,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {10184#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10185#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:30,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {10185#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10186#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:30,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {10186#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10187#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:30,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {10187#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10188#(and (<= (div main_~x~0 4294967296) 0) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:02:30,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {10188#(and (<= (div main_~x~0 4294967296) 0) (<= 268435387 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {10157#false} is VALID [2022-04-15 06:02:30,673 INFO L272 TraceCheckUtils]: 34: Hoare triple {10157#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10157#false} is VALID [2022-04-15 06:02:30,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {10157#false} ~cond := #in~cond; {10157#false} is VALID [2022-04-15 06:02:30,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {10157#false} assume 0 == ~cond; {10157#false} is VALID [2022-04-15 06:02:30,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2022-04-15 06:02:30,673 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:02:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:30,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047755210] [2022-04-15 06:02:30,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047755210] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:30,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803364594] [2022-04-15 06:02:30,674 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:02:30,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:30,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:30,675 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:02:30,676 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:02:33,442 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-15 06:02:33,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:33,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 06:02:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:33,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:33,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {10156#true} call ULTIMATE.init(); {10156#true} is VALID [2022-04-15 06:02:33,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {10156#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10156#true} is VALID [2022-04-15 06:02:33,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-15 06:02:33,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-15 06:02:33,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {10156#true} call #t~ret4 := main(); {10156#true} is VALID [2022-04-15 06:02:33,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {10156#true} ~x~0 := 268435441; {10161#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:33,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {10161#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10162#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:33,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {10162#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10163#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:33,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {10163#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10164#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:33,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {10164#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10165#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:33,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {10165#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10166#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:33,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {10166#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10167#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:33,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {10167#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10168#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:33,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {10168#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10169#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:33,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {10169#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10170#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:33,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {10170#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10171#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:33,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {10171#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10172#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:33,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {10172#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10173#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:33,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {10173#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10174#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:33,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {10174#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10175#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:33,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {10175#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10176#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:33,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {10176#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10177#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:33,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {10177#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10178#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:33,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {10178#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10179#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:33,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {10179#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10180#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:33,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {10180#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10181#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:33,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {10181#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10182#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:33,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {10182#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10183#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:33,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {10183#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10184#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:33,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {10184#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10185#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:33,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {10185#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10186#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:33,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {10186#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10187#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:33,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {10187#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10289#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:02:33,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {10289#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {10157#false} is VALID [2022-04-15 06:02:33,812 INFO L272 TraceCheckUtils]: 34: Hoare triple {10157#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10157#false} is VALID [2022-04-15 06:02:33,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {10157#false} ~cond := #in~cond; {10157#false} is VALID [2022-04-15 06:02:33,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {10157#false} assume 0 == ~cond; {10157#false} is VALID [2022-04-15 06:02:33,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2022-04-15 06:02:33,813 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:02:33,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:35,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2022-04-15 06:02:35,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {10157#false} assume 0 == ~cond; {10157#false} is VALID [2022-04-15 06:02:35,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {10157#false} ~cond := #in~cond; {10157#false} is VALID [2022-04-15 06:02:35,222 INFO L272 TraceCheckUtils]: 34: Hoare triple {10157#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10157#false} is VALID [2022-04-15 06:02:35,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {10317#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {10157#false} is VALID [2022-04-15 06:02:35,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {10321#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10317#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:02:35,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {10325#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10321#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:02:35,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {10329#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10325#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:35,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {10333#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10329#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:35,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {10337#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10333#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:35,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {10341#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10337#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:02:35,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {10345#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10341#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:02:35,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {10349#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10345#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:35,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {10353#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10349#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:02:35,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {10357#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10353#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:02:35,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {10361#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10357#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:35,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {10365#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10361#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:35,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {10369#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10365#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:35,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {10373#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10369#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:02:35,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {10377#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10373#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:02:35,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {10381#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10377#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:02:35,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {10385#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10381#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:02:35,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {10389#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10385#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:02:35,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {10393#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10389#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:35,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {10397#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10393#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:02:35,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {10401#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10397#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:02:35,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {10405#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10401#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:35,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {10409#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10405#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:02:35,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {10413#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10409#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:35,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {10417#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10413#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:02:35,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {10421#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10417#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:35,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {10425#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10421#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:02:35,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {10156#true} ~x~0 := 268435441; {10425#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:02:35,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {10156#true} call #t~ret4 := main(); {10156#true} is VALID [2022-04-15 06:02:35,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-15 06:02:35,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-15 06:02:35,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {10156#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10156#true} is VALID [2022-04-15 06:02:35,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {10156#true} call ULTIMATE.init(); {10156#true} is VALID [2022-04-15 06:02:35,245 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:02:35,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803364594] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:35,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:35,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 06:02:35,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:35,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244778345] [2022-04-15 06:02:35,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244778345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:35,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:35,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 06:02:35,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283450951] [2022-04-15 06:02:35,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:35,246 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:02:35,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:35,246 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:02:35,269 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:02:35,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 06:02:35,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:35,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 06:02:35,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=957, Invalid=2583, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:02:35,270 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:02:37,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:37,089 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 06:02:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:02:37,089 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:02:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:37,089 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:02:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 06:02:37,090 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:02:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 06:02:37,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-15 06:02:37,124 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:37,125 INFO L225 Difference]: With dead ends: 45 [2022-04-15 06:02:37,125 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 06:02:37,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1907, Invalid=5749, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 06:02:37,126 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:37,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:02:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 06:02:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 06:02:37,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:37,166 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:02:37,167 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:02:37,167 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:02:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:37,167 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 06:02:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 06:02:37,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:37,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:37,168 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:02:37,168 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:02:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:37,168 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 06:02:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 06:02:37,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:37,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:37,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:37,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:37,169 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:02:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-15 06:02:37,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-15 06:02:37,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:37,169 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-15 06:02:37,169 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:02:37,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-15 06:02:37,207 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:02:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 06:02:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 06:02:37,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:37,208 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:37,214 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:02:37,413 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:02:37,609 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:02:37,609 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:37,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 55 times [2022-04-15 06:02:37,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:37,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [565623845] [2022-04-15 06:02:37,748 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:37,750 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash -271463497, now seen corresponding path program 1 times [2022-04-15 06:02:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:37,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909451054] [2022-04-15 06:02:37,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:37,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:37,758 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_28.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:02:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:37,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560010871] [2022-04-15 06:02:37,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:37,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:37,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:37,767 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:02:37,768 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:02:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:37,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:37,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:37,817 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 56 times [2022-04-15 06:02:37,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:37,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254765874] [2022-04-15 06:02:37,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:37,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:38,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:38,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {10786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10752#true} is VALID [2022-04-15 06:02:38,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-15 06:02:38,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-15 06:02:38,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {10752#true} call ULTIMATE.init(); {10786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:38,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {10786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10752#true} is VALID [2022-04-15 06:02:38,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-15 06:02:38,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-15 06:02:38,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {10752#true} call #t~ret4 := main(); {10752#true} is VALID [2022-04-15 06:02:38,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {10752#true} ~x~0 := 268435441; {10757#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:38,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {10757#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10758#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:38,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {10758#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10759#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:38,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {10759#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10760#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:38,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {10760#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10761#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:38,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {10761#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10762#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:38,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {10762#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10763#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:38,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {10763#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10764#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:38,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {10764#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10765#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:38,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {10765#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10766#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:38,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {10766#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10767#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:38,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {10767#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10768#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:38,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {10768#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10769#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:38,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {10769#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10770#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:38,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {10770#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10771#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:38,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {10771#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10772#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:38,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {10772#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10773#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:38,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {10773#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10774#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:38,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {10774#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10775#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:38,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {10775#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10776#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:38,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {10776#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10777#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:38,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {10777#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10778#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:38,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {10778#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10779#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:38,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {10779#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10780#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:38,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {10780#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10781#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:38,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {10781#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10782#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:38,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {10782#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10783#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:38,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {10783#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10784#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:02:38,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {10784#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10785#(and (<= (div main_~x~0 4294967296) 0) (<= 268435385 main_~x~0))} is VALID [2022-04-15 06:02:38,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {10785#(and (<= (div main_~x~0 4294967296) 0) (<= 268435385 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {10753#false} is VALID [2022-04-15 06:02:38,468 INFO L272 TraceCheckUtils]: 35: Hoare triple {10753#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10753#false} is VALID [2022-04-15 06:02:38,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {10753#false} ~cond := #in~cond; {10753#false} is VALID [2022-04-15 06:02:38,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {10753#false} assume 0 == ~cond; {10753#false} is VALID [2022-04-15 06:02:38,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {10753#false} assume !false; {10753#false} is VALID [2022-04-15 06:02:38,469 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:02:38,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:38,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254765874] [2022-04-15 06:02:38,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254765874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:38,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830124724] [2022-04-15 06:02:38,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:02:38,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:38,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:38,470 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:02:38,471 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:02:38,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:02:38,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:38,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 06:02:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:38,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:38,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {10752#true} call ULTIMATE.init(); {10752#true} is VALID [2022-04-15 06:02:38,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {10752#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10752#true} is VALID [2022-04-15 06:02:38,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-15 06:02:38,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-15 06:02:38,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {10752#true} call #t~ret4 := main(); {10752#true} is VALID [2022-04-15 06:02:38,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {10752#true} ~x~0 := 268435441; {10757#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:38,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {10757#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10758#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:38,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {10758#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10759#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:38,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {10759#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10760#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:38,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {10760#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10761#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:38,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {10761#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10762#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:38,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {10762#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10763#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:38,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {10763#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10764#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:38,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {10764#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10765#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:38,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {10765#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10766#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:38,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {10766#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10767#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:38,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {10767#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10768#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:38,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {10768#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10769#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:38,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {10769#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10770#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:38,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {10770#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10771#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:38,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {10771#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10772#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:38,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {10772#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10773#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:38,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {10773#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10774#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:38,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {10774#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10775#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:38,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {10775#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10776#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:38,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {10776#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10777#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:38,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {10777#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10778#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:38,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {10778#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10779#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:38,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {10779#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10780#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:38,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {10780#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10781#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:38,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {10781#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10782#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:38,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {10782#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10783#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:38,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {10783#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10784#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:02:38,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {10784#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10889#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:02:38,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {10889#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !(~x~0 % 4294967296 > 1); {10753#false} is VALID [2022-04-15 06:02:38,937 INFO L272 TraceCheckUtils]: 35: Hoare triple {10753#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10753#false} is VALID [2022-04-15 06:02:38,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {10753#false} ~cond := #in~cond; {10753#false} is VALID [2022-04-15 06:02:38,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {10753#false} assume 0 == ~cond; {10753#false} is VALID [2022-04-15 06:02:38,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {10753#false} assume !false; {10753#false} is VALID [2022-04-15 06:02:38,938 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:02:38,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:40,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {10753#false} assume !false; {10753#false} is VALID [2022-04-15 06:02:40,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {10753#false} assume 0 == ~cond; {10753#false} is VALID [2022-04-15 06:02:40,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {10753#false} ~cond := #in~cond; {10753#false} is VALID [2022-04-15 06:02:40,324 INFO L272 TraceCheckUtils]: 35: Hoare triple {10753#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10753#false} is VALID [2022-04-15 06:02:40,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {10917#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {10753#false} is VALID [2022-04-15 06:02:40,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {10921#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10917#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:02:40,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {10925#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10921#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:02:40,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {10929#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10925#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {10933#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10929#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {10937#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10933#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {10941#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10937#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:02:40,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {10945#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10941#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:02:40,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {10949#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10945#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {10953#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10949#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:02:40,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {10957#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10953#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:02:40,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {10961#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10957#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {10965#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10961#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {10969#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10965#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {10973#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10969#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:02:40,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {10977#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10973#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:02:40,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {10981#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10977#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:02:40,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {10985#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10981#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:02:40,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {10989#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10985#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:02:40,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {10993#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10989#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {10997#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10993#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:02:40,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {11001#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {10997#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:02:40,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {11005#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11001#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {11009#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11005#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:02:40,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {11013#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11009#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {11017#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11013#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:02:40,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {11021#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11017#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {11025#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11021#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:02:40,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {11029#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11025#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:02:40,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {10752#true} ~x~0 := 268435441; {11029#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:40,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {10752#true} call #t~ret4 := main(); {10752#true} is VALID [2022-04-15 06:02:40,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-15 06:02:40,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-15 06:02:40,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {10752#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10752#true} is VALID [2022-04-15 06:02:40,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {10752#true} call ULTIMATE.init(); {10752#true} is VALID [2022-04-15 06:02:40,345 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:02:40,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830124724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:40,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:40,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 06:02:40,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:40,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [565623845] [2022-04-15 06:02:40,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [565623845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:40,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:40,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:02:40,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547822923] [2022-04-15 06:02:40,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:40,350 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:02:40,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:40,350 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:02:40,374 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:02:40,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:02:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:40,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:02:40,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=2762, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:02:40,377 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:02:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:42,157 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 06:02:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 06:02:42,158 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:02:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:42,158 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:02:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 06:02:42,159 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:02:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 06:02:42,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-15 06:02:42,187 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:42,187 INFO L225 Difference]: With dead ends: 46 [2022-04-15 06:02:42,187 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:02:42,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2033, Invalid=6157, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 06:02:42,189 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:42,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 108 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:02:42,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:02:42,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 06:02:42,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:42,229 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:02:42,229 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:02:42,229 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:02:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:42,230 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 06:02:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 06:02:42,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:42,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:42,230 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:02:42,230 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:02:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:42,231 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 06:02:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 06:02:42,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:42,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:42,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:42,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:42,231 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:02:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-15 06:02:42,232 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-15 06:02:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:42,232 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-15 06:02:42,232 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:02:42,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-15 06:02:42,262 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:02:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 06:02:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 06:02:42,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:42,262 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:42,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-04-15 06:02:42,467 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:02:42,663 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:02:42,663 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:42,663 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 57 times [2022-04-15 06:02:42,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:42,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1808084523] [2022-04-15 06:02:42,788 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:42,789 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash -212358153, now seen corresponding path program 1 times [2022-04-15 06:02:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:42,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674350141] [2022-04-15 06:02:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:42,795 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_29.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:02:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:42,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064523890] [2022-04-15 06:02:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:42,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:42,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:42,801 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:02:42,814 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:02:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:42,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:42,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 58 times [2022-04-15 06:02:42,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:42,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730555694] [2022-04-15 06:02:42,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:42,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:43,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:43,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {11399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11364#true} is VALID [2022-04-15 06:02:43,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-15 06:02:43,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-15 06:02:43,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {11364#true} call ULTIMATE.init(); {11399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:43,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {11399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11364#true} is VALID [2022-04-15 06:02:43,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-15 06:02:43,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-15 06:02:43,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {11364#true} call #t~ret4 := main(); {11364#true} is VALID [2022-04-15 06:02:43,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {11364#true} ~x~0 := 268435441; {11369#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:43,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {11369#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11370#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:43,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {11370#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11371#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:43,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {11371#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11372#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:43,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {11372#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11373#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:43,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {11373#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11374#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:43,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {11374#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11375#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:43,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {11375#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11376#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:43,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {11376#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11377#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:43,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {11377#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11378#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:43,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {11378#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11379#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:43,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {11379#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11380#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:43,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {11380#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11381#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:43,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {11381#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11382#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:43,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {11382#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11383#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:43,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {11383#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11384#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:43,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {11384#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11385#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:43,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {11385#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11386#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:43,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {11386#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11387#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:43,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {11387#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11388#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:43,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {11388#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11389#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:43,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {11389#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11390#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:43,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {11390#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11391#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:43,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {11391#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11392#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:43,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {11392#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11393#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:43,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {11393#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11394#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:43,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {11394#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11395#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:43,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {11395#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11396#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:02:43,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {11396#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11397#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:02:43,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {11397#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11398#(and (<= 268435383 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:02:43,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {11398#(and (<= 268435383 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {11365#false} is VALID [2022-04-15 06:02:43,399 INFO L272 TraceCheckUtils]: 36: Hoare triple {11365#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11365#false} is VALID [2022-04-15 06:02:43,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#false} ~cond := #in~cond; {11365#false} is VALID [2022-04-15 06:02:43,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#false} assume 0 == ~cond; {11365#false} is VALID [2022-04-15 06:02:43,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {11365#false} assume !false; {11365#false} is VALID [2022-04-15 06:02:43,399 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:02:43,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:43,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730555694] [2022-04-15 06:02:43,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730555694] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270979120] [2022-04-15 06:02:43,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:02:43,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:43,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:43,401 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:02:43,401 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:02:43,500 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:02:43,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:43,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-15 06:02:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:43,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:43,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {11364#true} call ULTIMATE.init(); {11364#true} is VALID [2022-04-15 06:02:43,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {11364#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11364#true} is VALID [2022-04-15 06:02:43,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-15 06:02:43,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-15 06:02:43,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {11364#true} call #t~ret4 := main(); {11364#true} is VALID [2022-04-15 06:02:43,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {11364#true} ~x~0 := 268435441; {11369#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:43,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {11369#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11370#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:43,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {11370#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11371#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:43,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {11371#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11372#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:43,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {11372#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11373#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:43,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {11373#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11374#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:43,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {11374#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11375#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:43,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {11375#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11376#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:43,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {11376#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11377#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:43,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {11377#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11378#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:43,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {11378#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11379#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:43,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {11379#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11380#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:43,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {11380#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11381#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:43,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {11381#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11382#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:43,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {11382#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11383#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:43,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {11383#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11384#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:43,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {11384#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11385#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:43,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {11385#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11386#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:43,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {11386#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11387#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:43,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {11387#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11388#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:43,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {11388#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11389#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:43,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {11389#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11390#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:43,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {11390#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11391#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:43,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {11391#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11392#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:43,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {11392#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11393#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:43,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {11393#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11394#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:43,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {11394#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11395#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:43,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {11395#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11396#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:02:43,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {11396#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11397#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:02:43,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {11397#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11505#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:02:43,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {11505#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !(~x~0 % 4294967296 > 1); {11365#false} is VALID [2022-04-15 06:02:43,873 INFO L272 TraceCheckUtils]: 36: Hoare triple {11365#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11365#false} is VALID [2022-04-15 06:02:43,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#false} ~cond := #in~cond; {11365#false} is VALID [2022-04-15 06:02:43,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#false} assume 0 == ~cond; {11365#false} is VALID [2022-04-15 06:02:43,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {11365#false} assume !false; {11365#false} is VALID [2022-04-15 06:02:43,873 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:02:43,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:45,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {11365#false} assume !false; {11365#false} is VALID [2022-04-15 06:02:45,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#false} assume 0 == ~cond; {11365#false} is VALID [2022-04-15 06:02:45,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#false} ~cond := #in~cond; {11365#false} is VALID [2022-04-15 06:02:45,300 INFO L272 TraceCheckUtils]: 36: Hoare triple {11365#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11365#false} is VALID [2022-04-15 06:02:45,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {11533#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {11365#false} is VALID [2022-04-15 06:02:45,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {11537#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11533#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:02:45,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {11541#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11537#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:02:45,304 INFO L290 TraceCheckUtils]: 32: Hoare triple {11545#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11541#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {11549#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11545#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {11553#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11549#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {11557#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11553#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:02:45,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {11561#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11557#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:02:45,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {11565#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11561#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {11569#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11565#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:02:45,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {11573#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11569#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:02:45,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {11577#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11573#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {11581#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11577#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {11585#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11581#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {11589#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11585#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:02:45,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {11593#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11589#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:02:45,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {11597#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11593#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:02:45,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {11601#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11597#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:02:45,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {11605#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11601#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:02:45,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {11609#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11605#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {11613#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11609#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:02:45,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {11617#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11613#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:02:45,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {11621#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11617#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {11625#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11621#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:02:45,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {11629#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11625#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {11633#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11629#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:02:45,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {11637#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11633#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {11641#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11637#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:02:45,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {11645#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11641#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:02:45,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {11649#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11645#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {11364#true} ~x~0 := 268435441; {11649#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:02:45,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {11364#true} call #t~ret4 := main(); {11364#true} is VALID [2022-04-15 06:02:45,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-15 06:02:45,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-15 06:02:45,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {11364#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11364#true} is VALID [2022-04-15 06:02:45,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {11364#true} call ULTIMATE.init(); {11364#true} is VALID [2022-04-15 06:02:45,328 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:02:45,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270979120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:45,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:45,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-15 06:02:45,329 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:45,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1808084523] [2022-04-15 06:02:45,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1808084523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:45,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:45,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 06:02:45,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124101091] [2022-04-15 06:02:45,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:45,329 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:02:45,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:45,330 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:02:45,352 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:02:45,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 06:02:45,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:45,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 06:02:45,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=2947, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:02:45,353 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:02:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:47,098 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 06:02:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 06:02:47,098 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:02:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:47,099 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:02:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 06:02:47,099 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:02:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 06:02:47,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-15 06:02:47,138 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:47,139 INFO L225 Difference]: With dead ends: 47 [2022-04-15 06:02:47,139 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 06:02:47,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2163, Invalid=6579, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 06:02:47,140 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:47,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:02:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 06:02:47,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 06:02:47,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:47,179 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:02:47,180 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:02:47,180 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:02:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:47,180 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 06:02:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 06:02:47,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:47,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:47,181 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:02:47,181 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:02:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:47,181 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 06:02:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 06:02:47,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:47,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:47,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:47,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:47,182 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:02:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-15 06:02:47,182 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-15 06:02:47,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:47,183 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-15 06:02:47,183 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:02:47,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-15 06:02:47,213 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:02:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 06:02:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:02:47,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:47,214 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:47,233 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:02:47,425 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:02:47,619 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:02:47,620 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 59 times [2022-04-15 06:02:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:47,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704280639] [2022-04-15 06:02:47,750 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:47,751 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash -153252809, now seen corresponding path program 1 times [2022-04-15 06:02:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:47,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853964029] [2022-04-15 06:02:47,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:47,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:47,757 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_30.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:02:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:47,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649014643] [2022-04-15 06:02:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:47,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:47,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:47,761 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:02:47,762 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:02:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:47,799 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:47,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 60 times [2022-04-15 06:02:47,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:47,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087539235] [2022-04-15 06:02:47,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:47,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:48,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:48,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {12028#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11992#true} is VALID [2022-04-15 06:02:48,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-15 06:02:48,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-15 06:02:48,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {11992#true} call ULTIMATE.init(); {12028#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:48,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {12028#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11992#true} is VALID [2022-04-15 06:02:48,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-15 06:02:48,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-15 06:02:48,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {11992#true} call #t~ret4 := main(); {11992#true} is VALID [2022-04-15 06:02:48,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {11992#true} ~x~0 := 268435441; {11997#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:48,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {11997#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11998#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:48,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {11998#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11999#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:48,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {11999#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12000#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:48,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {12000#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12001#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:48,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {12001#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12002#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:48,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {12002#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12003#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:48,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {12003#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12004#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:48,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {12004#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12005#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:48,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {12005#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12006#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:48,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {12006#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12007#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:48,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {12007#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12008#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:48,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {12008#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12009#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:48,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {12009#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12010#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:48,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {12010#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12011#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:48,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {12011#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12012#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:48,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {12012#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12013#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:48,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {12013#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12014#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:48,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {12014#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12015#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:48,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {12015#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12016#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:48,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {12016#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12017#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:48,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {12017#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12018#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:48,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {12018#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12019#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:48,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {12019#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12020#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:48,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {12020#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12021#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:48,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {12021#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12022#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:48,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {12022#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12023#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:48,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {12023#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12024#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:02:48,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {12024#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12025#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:02:48,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {12025#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12026#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:02:48,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {12026#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12027#(and (<= (div main_~x~0 4294967296) 0) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:02:48,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {12027#(and (<= (div main_~x~0 4294967296) 0) (<= 268435381 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {11993#false} is VALID [2022-04-15 06:02:48,386 INFO L272 TraceCheckUtils]: 37: Hoare triple {11993#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11993#false} is VALID [2022-04-15 06:02:48,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {11993#false} ~cond := #in~cond; {11993#false} is VALID [2022-04-15 06:02:48,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {11993#false} assume 0 == ~cond; {11993#false} is VALID [2022-04-15 06:02:48,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-04-15 06:02:48,386 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:02:48,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:48,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087539235] [2022-04-15 06:02:48,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087539235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:48,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320412703] [2022-04-15 06:02:48,387 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:02:48,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:48,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:48,388 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:02:48,389 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:02:50,556 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 06:02:50,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:50,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-15 06:02:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:50,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:50,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {11992#true} call ULTIMATE.init(); {11992#true} is VALID [2022-04-15 06:02:50,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {11992#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11992#true} is VALID [2022-04-15 06:02:50,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-15 06:02:50,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-15 06:02:50,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {11992#true} call #t~ret4 := main(); {11992#true} is VALID [2022-04-15 06:02:50,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {11992#true} ~x~0 := 268435441; {11997#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:50,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {11997#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11998#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:50,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {11998#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {11999#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:50,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {11999#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12000#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:50,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {12000#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12001#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:50,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {12001#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12002#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:50,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {12002#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12003#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:50,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {12003#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12004#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:50,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {12004#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12005#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:50,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {12005#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12006#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:50,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {12006#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12007#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:50,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {12007#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12008#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:50,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {12008#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12009#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:50,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {12009#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12010#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:50,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {12010#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12011#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:50,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {12011#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12012#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:50,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {12012#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12013#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:50,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {12013#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12014#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:50,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {12014#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12015#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:50,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {12015#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12016#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:50,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {12016#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12017#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:50,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {12017#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12018#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:50,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {12018#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12019#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:50,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {12019#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12020#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:50,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {12020#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12021#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:50,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {12021#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12022#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:50,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {12022#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12023#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:50,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {12023#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12024#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:02:50,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {12024#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12025#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:02:50,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {12025#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12026#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:02:50,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {12026#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12137#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:02:50,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {12137#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {11993#false} is VALID [2022-04-15 06:02:50,893 INFO L272 TraceCheckUtils]: 37: Hoare triple {11993#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11993#false} is VALID [2022-04-15 06:02:50,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {11993#false} ~cond := #in~cond; {11993#false} is VALID [2022-04-15 06:02:50,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {11993#false} assume 0 == ~cond; {11993#false} is VALID [2022-04-15 06:02:50,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-04-15 06:02:50,893 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:02:50,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:53,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-04-15 06:02:53,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {12156#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11993#false} is VALID [2022-04-15 06:02:53,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {12160#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12156#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:02:53,096 INFO L272 TraceCheckUtils]: 37: Hoare triple {12164#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12160#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:02:53,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {12168#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {12164#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:02:53,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {12172#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12168#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {12176#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12172#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {12180#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12176#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {12184#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12180#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {12188#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12184#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {12192#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12188#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {12196#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12192#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {12200#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12196#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {12204#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12200#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {12208#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12204#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {12212#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12208#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {12216#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12212#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {12220#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12216#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {12224#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12220#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {12228#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12224#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {12232#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12228#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {12236#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12232#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {12240#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12236#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {12244#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12240#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {12248#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12244#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {12252#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12248#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {12256#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12252#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {12260#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12256#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {12264#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12260#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {12268#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12264#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {12272#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12268#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {12276#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12272#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {12280#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12276#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {12284#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12280#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {12288#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12284#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {11992#true} ~x~0 := 268435441; {12288#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:53,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {11992#true} call #t~ret4 := main(); {11992#true} is VALID [2022-04-15 06:02:53,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-15 06:02:53,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-15 06:02:53,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {11992#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11992#true} is VALID [2022-04-15 06:02:53,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {11992#true} call ULTIMATE.init(); {11992#true} is VALID [2022-04-15 06:02:53,143 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:02:53,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320412703] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:53,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:53,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 36] total 69 [2022-04-15 06:02:53,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:53,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704280639] [2022-04-15 06:02:53,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704280639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:53,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:53,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 06:02:53,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226215934] [2022-04-15 06:02:53,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:53,144 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:02:53,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:53,144 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:02:53,165 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:02:53,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 06:02:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:53,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 06:02:53,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3503, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 06:02:53,167 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:02:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:55,383 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 06:02:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 06:02:55,383 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:02:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:55,384 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:02:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 06:02:55,384 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:02:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 06:02:55,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-15 06:02:55,417 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:55,418 INFO L225 Difference]: With dead ends: 48 [2022-04-15 06:02:55,418 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 06:02:55,419 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2334, Invalid=7566, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 06:02:55,420 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:55,420 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:02:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 06:02:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 06:02:55,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:55,459 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:02:55,459 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:02:55,459 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:02:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:55,460 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 06:02:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 06:02:55,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:55,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:55,460 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:02:55,460 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:02:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:55,461 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 06:02:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 06:02:55,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:55,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:55,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:55,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:55,461 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:02:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-15 06:02:55,462 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-15 06:02:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:55,462 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-15 06:02:55,462 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:02:55,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-15 06:02:55,495 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:02:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 06:02:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:02:55,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:55,496 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:55,501 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:02:55,722 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:02:55,901 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:02:55,901 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:55,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:55,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 61 times [2022-04-15 06:02:55,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:55,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1710081079] [2022-04-15 06:02:56,042 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:56,044 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:02:56,045 INFO L85 PathProgramCache]: Analyzing trace with hash -94147465, now seen corresponding path program 1 times [2022-04-15 06:02:56,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:56,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081840943] [2022-04-15 06:02:56,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:56,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:56,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_31.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:02:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:02:56,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094319389] [2022-04-15 06:02:56,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:56,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:56,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:56,055 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:02:56,056 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:02:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:56,095 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:02:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:02:56,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:02:56,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 62 times [2022-04-15 06:02:56,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:56,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851685744] [2022-04-15 06:02:56,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:56,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:56,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {12676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12639#true} is VALID [2022-04-15 06:02:56,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-15 06:02:56,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-15 06:02:56,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {12639#true} call ULTIMATE.init(); {12676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:56,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {12676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12639#true} is VALID [2022-04-15 06:02:56,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-15 06:02:56,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-15 06:02:56,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {12639#true} call #t~ret4 := main(); {12639#true} is VALID [2022-04-15 06:02:56,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {12639#true} ~x~0 := 268435441; {12644#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:56,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {12644#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12645#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:56,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {12645#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12646#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:56,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {12646#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12647#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:56,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {12647#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12648#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:56,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {12648#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12649#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:56,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {12649#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12650#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:56,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {12650#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12651#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:56,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {12651#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12652#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:56,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {12652#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12653#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:56,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {12653#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12654#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:56,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {12654#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12655#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:56,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {12655#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12656#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:56,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {12656#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12657#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:56,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {12657#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12658#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:56,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {12658#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12659#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:56,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {12659#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12660#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:56,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {12660#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12661#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:56,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {12661#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12662#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:56,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {12662#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12663#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:56,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {12663#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12664#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:56,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {12664#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12665#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:56,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {12665#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12666#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:56,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {12666#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12667#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:56,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {12667#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12668#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:56,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {12668#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12669#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:56,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {12669#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12670#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:56,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {12670#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12671#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:02:56,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {12671#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12672#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:02:56,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {12672#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12673#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:02:56,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {12673#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12674#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:02:56,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {12674#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12675#(and (<= (div main_~x~0 4294967296) 0) (<= 268435379 main_~x~0))} is VALID [2022-04-15 06:02:56,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {12675#(and (<= (div main_~x~0 4294967296) 0) (<= 268435379 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {12640#false} is VALID [2022-04-15 06:02:56,756 INFO L272 TraceCheckUtils]: 38: Hoare triple {12640#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12640#false} is VALID [2022-04-15 06:02:56,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {12640#false} ~cond := #in~cond; {12640#false} is VALID [2022-04-15 06:02:56,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {12640#false} assume 0 == ~cond; {12640#false} is VALID [2022-04-15 06:02:56,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {12640#false} assume !false; {12640#false} is VALID [2022-04-15 06:02:56,757 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:02:56,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:56,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851685744] [2022-04-15 06:02:56,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851685744] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:56,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840377803] [2022-04-15 06:02:56,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:02:56,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:56,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:56,759 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:02:56,759 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:02:56,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:02:56,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:56,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-15 06:02:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:56,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:57,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {12639#true} call ULTIMATE.init(); {12639#true} is VALID [2022-04-15 06:02:57,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {12639#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12639#true} is VALID [2022-04-15 06:02:57,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-15 06:02:57,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-15 06:02:57,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {12639#true} call #t~ret4 := main(); {12639#true} is VALID [2022-04-15 06:02:57,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {12639#true} ~x~0 := 268435441; {12644#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:02:57,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {12644#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12645#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:02:57,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {12645#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12646#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:02:57,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {12646#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12647#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:02:57,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {12647#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12648#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:02:57,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {12648#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12649#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:02:57,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {12649#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12650#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:02:57,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {12650#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12651#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:02:57,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {12651#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12652#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:02:57,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {12652#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12653#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:02:57,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {12653#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12654#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:02:57,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {12654#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12655#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:02:57,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {12655#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12656#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:02:57,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {12656#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12657#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:02:57,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {12657#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12658#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:02:57,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {12658#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12659#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:02:57,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {12659#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12660#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:02:57,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {12660#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12661#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:02:57,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {12661#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12662#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:02:57,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {12662#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12663#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:02:57,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {12663#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12664#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:02:57,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {12664#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12665#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:02:57,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {12665#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12666#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:02:57,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {12666#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12667#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:02:57,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {12667#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12668#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:02:57,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {12668#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12669#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:02:57,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {12669#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12670#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:02:57,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {12670#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12671#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:02:57,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {12671#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12672#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:02:57,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {12672#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12673#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:02:57,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {12673#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12674#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:02:57,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {12674#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12788#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:02:57,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {12788#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !(~x~0 % 4294967296 > 1); {12640#false} is VALID [2022-04-15 06:02:57,157 INFO L272 TraceCheckUtils]: 38: Hoare triple {12640#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12640#false} is VALID [2022-04-15 06:02:57,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {12640#false} ~cond := #in~cond; {12640#false} is VALID [2022-04-15 06:02:57,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {12640#false} assume 0 == ~cond; {12640#false} is VALID [2022-04-15 06:02:57,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {12640#false} assume !false; {12640#false} is VALID [2022-04-15 06:02:57,158 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:02:57,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:59,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {12640#false} assume !false; {12640#false} is VALID [2022-04-15 06:02:59,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {12807#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12640#false} is VALID [2022-04-15 06:02:59,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {12811#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12807#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:02:59,516 INFO L272 TraceCheckUtils]: 38: Hoare triple {12815#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12811#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:02:59,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {12819#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {12815#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:02:59,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {12823#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12819#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {12827#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12823#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {12831#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12827#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {12835#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12831#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {12839#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12835#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {12843#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12839#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {12847#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12843#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {12851#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12847#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {12855#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12851#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {12859#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12855#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {12863#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12859#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {12867#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12863#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {12871#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12867#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {12875#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12871#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {12879#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12875#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {12883#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12879#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {12887#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12883#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {12891#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12887#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {12895#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12891#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {12899#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12895#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {12903#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12899#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {12907#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12903#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {12911#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12907#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {12915#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12911#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {12919#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12915#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {12923#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12919#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {12927#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12923#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {12931#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12927#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {12935#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12931#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {12939#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12935#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {12943#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {12939#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {12639#true} ~x~0 := 268435441; {12943#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:02:59,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {12639#true} call #t~ret4 := main(); {12639#true} is VALID [2022-04-15 06:02:59,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-15 06:02:59,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-15 06:02:59,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {12639#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12639#true} is VALID [2022-04-15 06:02:59,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {12639#true} call ULTIMATE.init(); {12639#true} is VALID [2022-04-15 06:02:59,561 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:02:59,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840377803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:59,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:59,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 37] total 71 [2022-04-15 06:02:59,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:59,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1710081079] [2022-04-15 06:02:59,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1710081079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:59,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:59,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 06:02:59,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507613825] [2022-04-15 06:02:59,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:59,562 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:02:59,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:59,562 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:02:59,587 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:02:59,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 06:02:59,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:59,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 06:02:59,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3711, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 06:02:59,597 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:03:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:01,855 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 06:03:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:03:01,855 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:03:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:01,855 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:03:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 06:03:01,856 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:03:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 06:03:01,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 49 transitions. [2022-04-15 06:03:01,885 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:03:01,886 INFO L225 Difference]: With dead ends: 49 [2022-04-15 06:03:01,886 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 06:03:01,887 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2473, Invalid=8033, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 06:03:01,887 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:01,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:03:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 06:03:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 06:03:01,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:01,955 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:03:01,955 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:03:01,955 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:03:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:01,956 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 06:03:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 06:03:01,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:01,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:01,956 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:03:01,956 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:03:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:01,957 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 06:03:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 06:03:01,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:01,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:01,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:01,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:01,957 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:03:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-15 06:03:01,958 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-15 06:03:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:01,958 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-15 06:03:01,958 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:03:01,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-15 06:03:01,989 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:03:01,990 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 06:03:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 06:03:01,990 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:01,990 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:02,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-04-15 06:03:02,206 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:03:02,403 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:03:02,403 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:02,404 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 63 times [2022-04-15 06:03:02,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:02,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [464566041] [2022-04-15 06:03:02,545 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,547 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash -35042121, now seen corresponding path program 1 times [2022-04-15 06:03:02,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:02,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581701679] [2022-04-15 06:03:02,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:02,556 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_32.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)) (- 1))) 0)) [2022-04-15 06:03:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:02,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941413359] [2022-04-15 06:03:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:02,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:02,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:02,568 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:03:02,569 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:03:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:02,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:02,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:02,612 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 64 times [2022-04-15 06:03:02,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:02,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590360551] [2022-04-15 06:03:02,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:03,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {13340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13302#true} is VALID [2022-04-15 06:03:03,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-15 06:03:03,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-15 06:03:03,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {13302#true} call ULTIMATE.init(); {13340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:03,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {13340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13302#true} is VALID [2022-04-15 06:03:03,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-15 06:03:03,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-15 06:03:03,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret4 := main(); {13302#true} is VALID [2022-04-15 06:03:03,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {13302#true} ~x~0 := 268435441; {13307#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:03,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {13307#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13308#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:03,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {13308#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13309#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:03,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {13309#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13310#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:03,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {13310#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13311#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:03,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {13311#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13312#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:03,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {13312#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13313#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:03,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {13313#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13314#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:03,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {13314#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13315#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:03,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {13315#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13316#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:03,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {13316#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13317#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:03,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {13317#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13318#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:03,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {13318#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13319#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:03,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {13319#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13320#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:03,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {13320#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13321#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:03,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {13321#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13322#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:03,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {13322#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13323#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:03,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {13323#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13324#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:03,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {13324#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13325#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:03,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {13325#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13326#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:03,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {13326#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13327#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:03,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {13327#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13328#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:03,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {13328#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13329#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:03,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {13329#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13330#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:03,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {13330#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13331#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:03,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {13331#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13332#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:03,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {13332#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13333#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:03,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {13333#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13334#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:03,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {13334#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13335#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:03,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {13335#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13336#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:03,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {13336#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13337#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:03,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {13337#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13338#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:03,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {13338#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13339#(and (<= (div main_~x~0 4294967296) 0) (<= 268435377 main_~x~0))} is VALID [2022-04-15 06:03:03,289 INFO L290 TraceCheckUtils]: 38: Hoare triple {13339#(and (<= (div main_~x~0 4294967296) 0) (<= 268435377 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {13303#false} is VALID [2022-04-15 06:03:03,289 INFO L272 TraceCheckUtils]: 39: Hoare triple {13303#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13303#false} is VALID [2022-04-15 06:03:03,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {13303#false} ~cond := #in~cond; {13303#false} is VALID [2022-04-15 06:03:03,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {13303#false} assume 0 == ~cond; {13303#false} is VALID [2022-04-15 06:03:03,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-15 06:03:03,289 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:03:03,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:03,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590360551] [2022-04-15 06:03:03,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590360551] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:03,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322837153] [2022-04-15 06:03:03,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:03:03,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:03,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:03,291 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:03:03,291 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:03:03,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:03:03,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:03,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-15 06:03:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:03,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:03,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {13302#true} call ULTIMATE.init(); {13302#true} is VALID [2022-04-15 06:03:03,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13302#true} is VALID [2022-04-15 06:03:03,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-15 06:03:03,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-15 06:03:03,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret4 := main(); {13302#true} is VALID [2022-04-15 06:03:03,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {13302#true} ~x~0 := 268435441; {13307#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:03,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {13307#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13308#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:03,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {13308#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13309#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:03,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {13309#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13310#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:03,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {13310#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13311#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:03,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {13311#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13312#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:03,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {13312#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13313#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:03,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {13313#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13314#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:03,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {13314#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13315#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:03,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {13315#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13316#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:03,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {13316#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13317#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:03,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {13317#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13318#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:03,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {13318#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13319#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:03,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {13319#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13320#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:03,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {13320#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13321#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:03,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {13321#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13322#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:03,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {13322#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13323#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:03,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {13323#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13324#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:03,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {13324#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13325#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:03,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {13325#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13326#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:03,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {13326#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13327#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:03,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {13327#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13328#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:03,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {13328#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13329#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:03,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {13329#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13330#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:03,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {13330#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13331#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:03,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {13331#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13332#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:03,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {13332#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13333#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:03,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {13333#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13334#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:03,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {13334#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13335#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:03,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {13335#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13336#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:03,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {13336#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13337#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:03,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {13337#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13338#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:03,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {13338#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13455#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:03,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {13455#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !(~x~0 % 4294967296 > 1); {13303#false} is VALID [2022-04-15 06:03:03,822 INFO L272 TraceCheckUtils]: 39: Hoare triple {13303#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13303#false} is VALID [2022-04-15 06:03:03,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {13303#false} ~cond := #in~cond; {13303#false} is VALID [2022-04-15 06:03:03,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {13303#false} assume 0 == ~cond; {13303#false} is VALID [2022-04-15 06:03:03,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-15 06:03:03,822 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:03:03,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:05,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-15 06:03:05,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {13303#false} assume 0 == ~cond; {13303#false} is VALID [2022-04-15 06:03:05,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {13303#false} ~cond := #in~cond; {13303#false} is VALID [2022-04-15 06:03:05,492 INFO L272 TraceCheckUtils]: 39: Hoare triple {13303#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13303#false} is VALID [2022-04-15 06:03:05,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {13483#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {13303#false} is VALID [2022-04-15 06:03:05,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {13487#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13483#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:03:05,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {13491#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13487#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:03:05,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {13495#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13491#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {13499#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13495#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {13503#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13499#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {13507#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13503#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:03:05,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {13511#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13507#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:03:05,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {13515#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13511#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {13519#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13515#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:03:05,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {13523#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13519#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:03:05,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {13527#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13523#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {13531#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13527#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {13535#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13531#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {13539#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13535#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:03:05,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {13543#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13539#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:03:05,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {13547#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13543#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:03:05,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {13551#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13547#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:03:05,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {13555#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13551#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:03:05,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {13559#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13555#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {13563#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13559#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:03:05,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {13567#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13563#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:03:05,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {13571#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13567#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {13575#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13571#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:03:05,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {13579#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13575#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {13583#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13579#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:03:05,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {13587#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13583#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {13591#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13587#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:03:05,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {13595#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13591#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:03:05,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {13599#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13595#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {13603#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13599#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:05,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {13607#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13603#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:03:05,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {13611#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13607#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:03:05,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {13302#true} ~x~0 := 268435441; {13611#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:03:05,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret4 := main(); {13302#true} is VALID [2022-04-15 06:03:05,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-15 06:03:05,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-15 06:03:05,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13302#true} is VALID [2022-04-15 06:03:05,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {13302#true} call ULTIMATE.init(); {13302#true} is VALID [2022-04-15 06:03:05,524 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:03:05,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322837153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:05,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:05,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-15 06:03:05,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:05,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [464566041] [2022-04-15 06:03:05,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [464566041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:05,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:05,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 06:03:05,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097371725] [2022-04-15 06:03:05,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:05,525 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:03:05,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:05,525 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:03:05,563 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:03:05,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 06:03:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:05,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 06:03:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1292, Invalid=3538, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 06:03:05,564 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:03:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:07,694 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 06:03:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 06:03:07,694 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:03:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:07,695 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:03:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 06:03:07,695 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:03:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 06:03:07,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-15 06:03:07,727 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:07,728 INFO L225 Difference]: With dead ends: 50 [2022-04-15 06:03:07,728 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 06:03:07,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2577, Invalid=7929, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 06:03:07,729 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:07,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:03:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 06:03:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 06:03:07,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:07,773 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:03:07,773 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:03:07,773 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:03:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:07,774 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 06:03:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 06:03:07,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:07,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:07,774 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:03:07,774 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:03:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:07,775 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 06:03:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 06:03:07,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:07,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:07,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:07,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:07,775 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:03:07,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-15 06:03:07,776 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-15 06:03:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:07,776 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-15 06:03:07,776 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:03:07,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-15 06:03:07,809 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:03:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 06:03:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:03:07,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:07,810 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:07,825 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:03:08,032 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:03:08,223 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:03:08,223 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 65 times [2022-04-15 06:03:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:08,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2073527342] [2022-04-15 06:03:08,349 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:08,350 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash 24063223, now seen corresponding path program 1 times [2022-04-15 06:03:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:08,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278861107] [2022-04-15 06:03:08,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:08,357 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_33.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:03:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:08,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291014546] [2022-04-15 06:03:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:08,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:08,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:08,361 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:03:08,362 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:03:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:08,397 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:08,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 66 times [2022-04-15 06:03:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:08,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5801821] [2022-04-15 06:03:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:09,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:09,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {14017#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13978#true} is VALID [2022-04-15 06:03:09,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-15 06:03:09,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-15 06:03:09,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {13978#true} call ULTIMATE.init(); {14017#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:09,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {14017#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13978#true} is VALID [2022-04-15 06:03:09,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-15 06:03:09,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-15 06:03:09,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {13978#true} call #t~ret4 := main(); {13978#true} is VALID [2022-04-15 06:03:09,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {13978#true} ~x~0 := 268435441; {13983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:09,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {13983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:09,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {13984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:09,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {13985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:09,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {13986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:09,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {13987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:09,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {13988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:09,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {13989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:09,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {13990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:09,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {13991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:09,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {13992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:09,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {13993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:09,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {13994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:09,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {13995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:09,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {13996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:09,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {13997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:09,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {13998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:09,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {13999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:09,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {14000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:09,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {14001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:09,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {14002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:09,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {14003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:09,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {14004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:09,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {14005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:09,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {14006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:09,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {14007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:09,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {14008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:09,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {14009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:09,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {14010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:09,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {14011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:09,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {14012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:09,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {14013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:09,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {14014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:09,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {14015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14016#(and (<= (div main_~x~0 4294967296) 0) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:09,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {14016#(and (<= (div main_~x~0 4294967296) 0) (<= 268435375 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {13979#false} is VALID [2022-04-15 06:03:09,086 INFO L272 TraceCheckUtils]: 40: Hoare triple {13979#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13979#false} is VALID [2022-04-15 06:03:09,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {13979#false} ~cond := #in~cond; {13979#false} is VALID [2022-04-15 06:03:09,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {13979#false} assume 0 == ~cond; {13979#false} is VALID [2022-04-15 06:03:09,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {13979#false} assume !false; {13979#false} is VALID [2022-04-15 06:03:09,086 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:03:09,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:09,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5801821] [2022-04-15 06:03:09,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5801821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:09,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326802387] [2022-04-15 06:03:09,087 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:03:09,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:09,087 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:03:09,088 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:03:10,084 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-15 06:03:10,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:10,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-15 06:03:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:10,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:10,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {13978#true} call ULTIMATE.init(); {13978#true} is VALID [2022-04-15 06:03:10,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {13978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13978#true} is VALID [2022-04-15 06:03:10,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-15 06:03:10,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-15 06:03:10,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {13978#true} call #t~ret4 := main(); {13978#true} is VALID [2022-04-15 06:03:10,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {13978#true} ~x~0 := 268435441; {13983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:10,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {13983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:10,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {13984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:10,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {13985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:10,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {13986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:10,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {13987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:10,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {13988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:10,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {13989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:10,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {13990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:10,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {13991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:10,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {13992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:10,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {13993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:10,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {13994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:10,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {13995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:10,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {13996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:10,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {13997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:10,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {13998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {13999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:10,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {13999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:10,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {14000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:10,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {14001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:10,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {14002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:10,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {14003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:10,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {14004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:10,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {14005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:10,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {14006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:10,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {14007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:10,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {14008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:10,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {14009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:10,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {14010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:10,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {14011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:10,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {14012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:10,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {14013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:10,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {14014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:10,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {14015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14135#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:10,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {14135#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {13979#false} is VALID [2022-04-15 06:03:10,455 INFO L272 TraceCheckUtils]: 40: Hoare triple {13979#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13979#false} is VALID [2022-04-15 06:03:10,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {13979#false} ~cond := #in~cond; {13979#false} is VALID [2022-04-15 06:03:10,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {13979#false} assume 0 == ~cond; {13979#false} is VALID [2022-04-15 06:03:10,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {13979#false} assume !false; {13979#false} is VALID [2022-04-15 06:03:10,456 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:03:10,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:12,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {13979#false} assume !false; {13979#false} is VALID [2022-04-15 06:03:12,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {14154#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13979#false} is VALID [2022-04-15 06:03:12,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {14158#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14154#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:03:12,917 INFO L272 TraceCheckUtils]: 40: Hoare triple {14162#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14158#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:03:12,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {14166#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {14162#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:03:12,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {14170#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14166#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {14174#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14170#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {14178#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14174#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {14182#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14178#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {14186#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14182#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {14190#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14186#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {14194#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14190#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {14198#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14194#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {14202#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14198#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {14206#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14202#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {14210#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14206#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {14214#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14210#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {14218#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14214#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {14222#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14218#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {14226#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14222#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {14230#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14226#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {14234#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14230#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {14238#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14234#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {14242#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14238#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {14246#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14242#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {14250#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14246#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {14254#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14250#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {14258#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14254#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {14262#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14258#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {14266#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14262#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {14270#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14266#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {14274#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14270#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {14278#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14274#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {14282#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14278#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {14286#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14282#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {14290#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14286#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {14294#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14290#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {14298#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14294#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {13978#true} ~x~0 := 268435441; {14298#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:12,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {13978#true} call #t~ret4 := main(); {13978#true} is VALID [2022-04-15 06:03:12,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-15 06:03:12,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-15 06:03:12,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {13978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13978#true} is VALID [2022-04-15 06:03:12,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {13978#true} call ULTIMATE.init(); {13978#true} is VALID [2022-04-15 06:03:12,949 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:03:12,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326802387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:12,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:12,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 39] total 75 [2022-04-15 06:03:12,950 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:12,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2073527342] [2022-04-15 06:03:12,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2073527342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:12,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:12,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 06:03:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821973145] [2022-04-15 06:03:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:12,951 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:03:12,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:12,951 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:03:12,979 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:03:12,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 06:03:12,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:12,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 06:03:12,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=4145, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 06:03:12,980 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:03:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:15,586 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 06:03:15,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 06:03:15,586 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:03:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:15,586 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:03:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 06:03:15,587 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:03:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 06:03:15,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-15 06:03:15,627 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:15,628 INFO L225 Difference]: With dead ends: 51 [2022-04-15 06:03:15,628 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 06:03:15,629 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2763, Invalid=9009, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 06:03:15,629 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:15,629 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:03:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 06:03:15,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 06:03:15,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:15,676 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:03:15,676 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:03:15,676 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:03:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:15,676 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 06:03:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 06:03:15,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:15,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:15,677 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:03:15,677 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:03:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:15,677 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 06:03:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 06:03:15,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:15,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:15,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:15,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:15,678 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:03:15,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-15 06:03:15,678 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-15 06:03:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:15,679 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-15 06:03:15,679 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:03:15,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-15 06:03:15,764 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:03:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 06:03:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 06:03:15,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:15,765 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:15,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-04-15 06:03:15,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:16,169 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:03:16,169 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 67 times [2022-04-15 06:03:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:16,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [883575348] [2022-04-15 06:03:16,321 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:16,332 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash 83168567, now seen corresponding path program 1 times [2022-04-15 06:03:16,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:16,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410260420] [2022-04-15 06:03:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:16,338 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_34.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:03:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:16,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [252820809] [2022-04-15 06:03:16,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:16,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:16,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:16,351 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:03:16,379 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:03:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:16,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:16,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:16,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 68 times [2022-04-15 06:03:16,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:16,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246732077] [2022-04-15 06:03:16,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:16,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:17,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:17,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {14713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14673#true} is VALID [2022-04-15 06:03:17,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-15 06:03:17,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-15 06:03:17,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {14673#true} call ULTIMATE.init(); {14713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:17,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {14713#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14673#true} is VALID [2022-04-15 06:03:17,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-15 06:03:17,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-15 06:03:17,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {14673#true} call #t~ret4 := main(); {14673#true} is VALID [2022-04-15 06:03:17,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {14673#true} ~x~0 := 268435441; {14678#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:17,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {14678#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14679#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:17,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {14679#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14680#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:17,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {14680#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14681#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:17,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {14681#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14682#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:17,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {14682#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14683#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:17,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {14683#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14684#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:17,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {14684#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14685#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:17,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {14685#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14686#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:17,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {14686#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14687#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:17,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {14687#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14688#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:17,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {14688#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14689#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:17,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {14689#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14690#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:17,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {14690#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14691#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:17,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {14691#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14692#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:17,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {14692#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14693#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:17,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {14693#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14694#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:17,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {14694#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14695#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:17,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {14695#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14696#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:17,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {14696#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14697#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:17,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {14697#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14698#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:17,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {14698#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14699#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:17,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {14699#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14700#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:17,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {14700#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14701#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:17,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {14701#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14702#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:17,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {14702#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14703#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:17,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {14703#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14704#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:17,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {14704#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14705#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:17,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {14705#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14706#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:17,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {14706#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14707#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:17,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {14707#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14708#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:17,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {14708#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14709#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:17,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {14709#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14710#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:17,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {14710#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14711#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:17,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {14711#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14712#(and (<= (div main_~x~0 4294967296) 0) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:03:17,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {14712#(and (<= (div main_~x~0 4294967296) 0) (<= 268435373 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {14674#false} is VALID [2022-04-15 06:03:17,238 INFO L272 TraceCheckUtils]: 41: Hoare triple {14674#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14674#false} is VALID [2022-04-15 06:03:17,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {14674#false} ~cond := #in~cond; {14674#false} is VALID [2022-04-15 06:03:17,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {14674#false} assume 0 == ~cond; {14674#false} is VALID [2022-04-15 06:03:17,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {14674#false} assume !false; {14674#false} is VALID [2022-04-15 06:03:17,239 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:03:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246732077] [2022-04-15 06:03:17,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246732077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139112040] [2022-04-15 06:03:17,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:03:17,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:17,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:17,256 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:03:17,303 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:03:17,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:03:17,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:17,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-15 06:03:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:17,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:17,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {14673#true} call ULTIMATE.init(); {14673#true} is VALID [2022-04-15 06:03:17,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {14673#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14673#true} is VALID [2022-04-15 06:03:17,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-15 06:03:17,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-15 06:03:17,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {14673#true} call #t~ret4 := main(); {14673#true} is VALID [2022-04-15 06:03:17,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {14673#true} ~x~0 := 268435441; {14678#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:17,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {14678#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14679#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:17,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {14679#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14680#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:17,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {14680#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14681#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:17,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {14681#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14682#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:17,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {14682#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14683#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:17,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {14683#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14684#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:17,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {14684#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14685#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:17,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {14685#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14686#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:17,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {14686#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14687#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:17,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {14687#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14688#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:17,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {14688#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14689#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:17,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {14689#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14690#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:17,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {14690#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14691#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:17,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {14691#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14692#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:17,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {14692#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14693#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:17,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {14693#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14694#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:17,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {14694#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14695#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:17,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {14695#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14696#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:17,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {14696#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14697#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:17,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {14697#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14698#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:17,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {14698#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14699#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:17,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {14699#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14700#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:17,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {14700#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14701#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:17,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {14701#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14702#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:17,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {14702#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14703#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:17,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {14703#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14704#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:17,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {14704#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14705#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:17,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {14705#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14706#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:17,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {14706#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14707#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:17,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {14707#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14708#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:17,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {14708#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14709#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:17,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {14709#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14710#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:17,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {14710#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14711#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:17,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {14711#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14834#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:03:17,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {14834#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {14674#false} is VALID [2022-04-15 06:03:17,736 INFO L272 TraceCheckUtils]: 41: Hoare triple {14674#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14674#false} is VALID [2022-04-15 06:03:17,736 INFO L290 TraceCheckUtils]: 42: Hoare triple {14674#false} ~cond := #in~cond; {14674#false} is VALID [2022-04-15 06:03:17,736 INFO L290 TraceCheckUtils]: 43: Hoare triple {14674#false} assume 0 == ~cond; {14674#false} is VALID [2022-04-15 06:03:17,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {14674#false} assume !false; {14674#false} is VALID [2022-04-15 06:03:17,737 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:03:17,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:20,422 INFO L290 TraceCheckUtils]: 44: Hoare triple {14674#false} assume !false; {14674#false} is VALID [2022-04-15 06:03:20,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {14853#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14674#false} is VALID [2022-04-15 06:03:20,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {14857#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14853#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:03:20,424 INFO L272 TraceCheckUtils]: 41: Hoare triple {14861#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14857#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:03:20,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {14865#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {14861#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:03:20,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {14869#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14865#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {14873#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14869#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {14877#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14873#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {14881#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14877#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {14885#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14881#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {14889#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14885#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {14893#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14889#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {14897#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14893#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {14901#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14897#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {14905#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14901#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {14909#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14905#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {14913#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14909#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {14917#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14913#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {14921#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14917#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {14925#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14921#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {14929#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14925#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {14933#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14929#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {14937#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14933#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {14941#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14937#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {14945#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14941#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {14949#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14945#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {14953#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14949#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {14957#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14953#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {14961#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14957#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {14965#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14961#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {14969#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14965#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {14973#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14969#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {14977#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14973#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {14981#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14977#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {14985#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14981#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {14989#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14985#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {14993#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14989#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {14997#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14993#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {15001#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {14997#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {14673#true} ~x~0 := 268435441; {15001#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:20,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {14673#true} call #t~ret4 := main(); {14673#true} is VALID [2022-04-15 06:03:20,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-15 06:03:20,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-15 06:03:20,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {14673#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14673#true} is VALID [2022-04-15 06:03:20,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {14673#true} call ULTIMATE.init(); {14673#true} is VALID [2022-04-15 06:03:20,482 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:03:20,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139112040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:20,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:20,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 40] total 77 [2022-04-15 06:03:20,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:20,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [883575348] [2022-04-15 06:03:20,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [883575348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:20,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:20,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 06:03:20,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260264779] [2022-04-15 06:03:20,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:20,483 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:03:20,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:20,484 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:03:20,510 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:03:20,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 06:03:20,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:20,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 06:03:20,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4371, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 06:03:20,511 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:03:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:23,126 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 06:03:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 06:03:23,126 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:03:23,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:23,126 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:03:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 06:03:23,127 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:03:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 06:03:23,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-15 06:03:23,158 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:23,158 INFO L225 Difference]: With dead ends: 52 [2022-04-15 06:03:23,158 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 06:03:23,159 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2914, Invalid=9518, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 06:03:23,159 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:23,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:03:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 06:03:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 06:03:23,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:23,204 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:03:23,204 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:03:23,204 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:03:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:23,204 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 06:03:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 06:03:23,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:23,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:23,205 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:03:23,205 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:03:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:23,205 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 06:03:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 06:03:23,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:23,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:23,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:23,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:23,206 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:03:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-15 06:03:23,206 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-15 06:03:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:23,206 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-15 06:03:23,206 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:03:23,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-15 06:03:23,238 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:03:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 06:03:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 06:03:23,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:23,239 INFO L499 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:23,255 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:03:23,443 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:03:23,639 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:03:23,639 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:23,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 69 times [2022-04-15 06:03:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:23,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1688223318] [2022-04-15 06:03:23,752 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:23,754 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash 142273911, now seen corresponding path program 1 times [2022-04-15 06:03:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:23,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029035560] [2022-04-15 06:03:23,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:23,759 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_35.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:03:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:23,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1666188744] [2022-04-15 06:03:23,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:23,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:23,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:23,764 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:03:23,765 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:03:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:23,801 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:23,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:23,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 70 times [2022-04-15 06:03:23,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:23,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621487559] [2022-04-15 06:03:23,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:23,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:24,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:24,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {15425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15384#true} is VALID [2022-04-15 06:03:24,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-15 06:03:24,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-15 06:03:24,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {15384#true} call ULTIMATE.init(); {15425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:24,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {15425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15384#true} is VALID [2022-04-15 06:03:24,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-15 06:03:24,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-15 06:03:24,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {15384#true} call #t~ret4 := main(); {15384#true} is VALID [2022-04-15 06:03:24,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {15384#true} ~x~0 := 268435441; {15389#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:24,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {15389#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15390#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:24,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {15390#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15391#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:24,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {15391#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15392#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:24,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {15392#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15393#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:24,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {15393#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15394#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:24,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {15394#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15395#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:24,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {15395#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15396#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:24,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {15396#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15397#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:24,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {15397#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15398#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:24,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {15398#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15399#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:24,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {15399#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15400#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:24,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {15400#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15401#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:24,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {15401#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15402#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:24,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {15402#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15403#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:24,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {15403#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15404#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:24,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {15404#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15405#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:24,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {15405#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15406#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:24,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {15406#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15407#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:24,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {15407#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15408#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:24,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {15408#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15409#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:24,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {15409#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15410#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:24,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {15410#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15411#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:24,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {15411#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15412#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:24,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {15412#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15413#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:24,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {15413#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15414#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:24,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {15414#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15415#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:24,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {15415#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15416#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:24,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {15416#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15417#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:24,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {15417#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15418#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:24,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {15418#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15419#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:24,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {15419#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15420#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:24,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {15420#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15421#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:24,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {15421#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15422#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:24,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {15422#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15423#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:03:24,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {15423#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15424#(and (<= (div main_~x~0 4294967296) 0) (<= 268435371 main_~x~0))} is VALID [2022-04-15 06:03:24,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {15424#(and (<= (div main_~x~0 4294967296) 0) (<= 268435371 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {15385#false} is VALID [2022-04-15 06:03:24,588 INFO L272 TraceCheckUtils]: 42: Hoare triple {15385#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15385#false} is VALID [2022-04-15 06:03:24,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {15385#false} ~cond := #in~cond; {15385#false} is VALID [2022-04-15 06:03:24,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {15385#false} assume 0 == ~cond; {15385#false} is VALID [2022-04-15 06:03:24,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#false} assume !false; {15385#false} is VALID [2022-04-15 06:03:24,589 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:03:24,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:24,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621487559] [2022-04-15 06:03:24,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621487559] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:24,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964661036] [2022-04-15 06:03:24,589 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:03:24,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:24,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:24,590 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:03:24,591 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:03:24,724 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:03:24,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:24,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-15 06:03:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:24,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:25,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {15384#true} call ULTIMATE.init(); {15384#true} is VALID [2022-04-15 06:03:25,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {15384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15384#true} is VALID [2022-04-15 06:03:25,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-15 06:03:25,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-15 06:03:25,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {15384#true} call #t~ret4 := main(); {15384#true} is VALID [2022-04-15 06:03:25,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {15384#true} ~x~0 := 268435441; {15389#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:25,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {15389#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15390#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:25,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {15390#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15391#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:25,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {15391#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15392#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:25,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {15392#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15393#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:25,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {15393#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15394#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:25,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {15394#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15395#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:25,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {15395#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15396#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:25,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {15396#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15397#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:25,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {15397#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15398#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:25,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {15398#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15399#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:25,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {15399#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15400#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:25,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {15400#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15401#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:25,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {15401#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15402#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:25,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {15402#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15403#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:25,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {15403#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15404#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:25,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {15404#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15405#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:25,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {15405#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15406#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:25,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {15406#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15407#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:25,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {15407#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15408#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:25,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {15408#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15409#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:25,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {15409#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15410#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:25,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {15410#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15411#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:25,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {15411#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15412#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:25,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {15412#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15413#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:25,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {15413#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15414#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:25,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {15414#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15415#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:25,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {15415#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15416#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:25,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {15416#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15417#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:25,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {15417#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15418#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:25,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {15418#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15419#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:25,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {15419#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15420#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:25,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {15420#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15421#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:25,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {15421#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15422#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:25,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {15422#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15423#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:03:25,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {15423#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15549#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:03:25,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {15549#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !(~x~0 % 4294967296 > 1); {15385#false} is VALID [2022-04-15 06:03:25,210 INFO L272 TraceCheckUtils]: 42: Hoare triple {15385#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15385#false} is VALID [2022-04-15 06:03:25,210 INFO L290 TraceCheckUtils]: 43: Hoare triple {15385#false} ~cond := #in~cond; {15385#false} is VALID [2022-04-15 06:03:25,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {15385#false} assume 0 == ~cond; {15385#false} is VALID [2022-04-15 06:03:25,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#false} assume !false; {15385#false} is VALID [2022-04-15 06:03:25,210 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:03:25,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:27,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#false} assume !false; {15385#false} is VALID [2022-04-15 06:03:27,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {15385#false} assume 0 == ~cond; {15385#false} is VALID [2022-04-15 06:03:27,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {15385#false} ~cond := #in~cond; {15385#false} is VALID [2022-04-15 06:03:27,348 INFO L272 TraceCheckUtils]: 42: Hoare triple {15385#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15385#false} is VALID [2022-04-15 06:03:27,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {15577#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {15385#false} is VALID [2022-04-15 06:03:27,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {15581#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15577#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:03:27,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {15585#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15581#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:03:27,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {15589#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15585#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {15593#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15589#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {15597#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15593#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {15601#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15597#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:03:27,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {15605#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15601#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:03:27,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {15609#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15605#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {15613#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15609#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:03:27,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {15617#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15613#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:03:27,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {15621#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15617#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {15625#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15621#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {15629#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15625#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {15633#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15629#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:03:27,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {15637#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15633#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:03:27,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {15641#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15637#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:03:27,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {15645#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15641#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:03:27,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {15649#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15645#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:03:27,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {15653#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15649#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {15657#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15653#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:03:27,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {15661#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15657#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:03:27,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {15665#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15661#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {15669#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15665#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:03:27,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {15673#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15669#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {15677#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15673#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:03:27,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {15681#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15677#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {15685#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15681#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:03:27,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {15689#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15685#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:03:27,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {15693#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15689#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {15697#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15693#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {15701#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15697#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:03:27,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {15705#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15701#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:03:27,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {15709#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15705#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:03:27,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {15713#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15709#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:27,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {15717#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {15713#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:03:27,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {15384#true} ~x~0 := 268435441; {15717#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:03:27,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {15384#true} call #t~ret4 := main(); {15384#true} is VALID [2022-04-15 06:03:27,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-15 06:03:27,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-15 06:03:27,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {15384#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15384#true} is VALID [2022-04-15 06:03:27,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {15384#true} call ULTIMATE.init(); {15384#true} is VALID [2022-04-15 06:03:27,384 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:03:27,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964661036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:27,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:27,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-15 06:03:27,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:27,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1688223318] [2022-04-15 06:03:27,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1688223318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:27,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:27,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 06:03:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472838881] [2022-04-15 06:03:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:27,386 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:03:27,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:27,386 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:03:27,417 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:03:27,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 06:03:27,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:27,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 06:03:27,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1517, Invalid=4183, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 06:03:27,418 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:03:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:29,948 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 06:03:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 06:03:29,948 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:03:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:29,949 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:03:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 06:03:29,949 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:03:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 06:03:29,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-15 06:03:29,986 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:29,987 INFO L225 Difference]: With dead ends: 53 [2022-04-15 06:03:29,987 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 06:03:29,988 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3027, Invalid=9405, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 06:03:29,988 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:29,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:03:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 06:03:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 06:03:30,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:30,040 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:03:30,040 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:03:30,040 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:03:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:30,041 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 06:03:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 06:03:30,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:30,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:30,041 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:03:30,041 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:03:30,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:30,042 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 06:03:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 06:03:30,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:30,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:30,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:30,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:30,042 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:03:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-15 06:03:30,043 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-15 06:03:30,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:30,043 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-15 06:03:30,043 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:03:30,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-15 06:03:30,079 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:03:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 06:03:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 06:03:30,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:30,080 INFO L499 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:30,098 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:03:30,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-04-15 06:03:30,481 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:03:30,481 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 71 times [2022-04-15 06:03:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:30,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2027709743] [2022-04-15 06:03:30,613 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:30,615 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 201379255, now seen corresponding path program 1 times [2022-04-15 06:03:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:30,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783929673] [2022-04-15 06:03:30,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:30,620 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_36.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:03:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:30,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301654742] [2022-04-15 06:03:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:30,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:30,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:30,624 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:03:30,625 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:03:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:30,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:30,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:30,665 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 72 times [2022-04-15 06:03:30,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:30,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484493688] [2022-04-15 06:03:30,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:30,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:31,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {16150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16108#true} is VALID [2022-04-15 06:03:31,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-15 06:03:31,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-15 06:03:31,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {16108#true} call ULTIMATE.init(); {16150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:31,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {16150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16108#true} is VALID [2022-04-15 06:03:31,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-15 06:03:31,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-15 06:03:31,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {16108#true} call #t~ret4 := main(); {16108#true} is VALID [2022-04-15 06:03:31,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {16108#true} ~x~0 := 268435441; {16113#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:31,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {16113#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16114#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:31,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {16114#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16115#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:31,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {16115#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16116#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:31,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {16116#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16117#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:31,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {16117#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16118#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:31,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {16118#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16119#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:31,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {16119#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16120#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:31,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {16120#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16121#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:31,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {16121#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16122#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:31,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {16122#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16123#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:31,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {16123#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16124#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:31,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {16124#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16125#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:31,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {16125#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16126#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:31,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {16126#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16127#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:31,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {16127#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16128#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:31,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {16128#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16129#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:31,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {16129#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16130#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:31,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {16130#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16131#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:31,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {16131#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16132#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:31,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {16132#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16133#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:31,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {16133#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16134#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:31,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {16134#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16135#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:31,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {16135#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16136#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:31,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {16136#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16137#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:31,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {16137#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16138#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:31,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {16138#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16139#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:31,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {16139#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16140#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:31,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {16140#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16141#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:31,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {16141#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16142#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:31,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {16142#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16143#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:31,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {16143#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16144#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:31,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {16144#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16145#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:31,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {16145#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16146#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:31,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {16146#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16147#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:03:31,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {16147#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16148#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:03:31,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {16148#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16149#(and (<= (div main_~x~0 4294967296) 0) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:03:31,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {16149#(and (<= (div main_~x~0 4294967296) 0) (<= 268435369 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {16109#false} is VALID [2022-04-15 06:03:31,479 INFO L272 TraceCheckUtils]: 43: Hoare triple {16109#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16109#false} is VALID [2022-04-15 06:03:31,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {16109#false} ~cond := #in~cond; {16109#false} is VALID [2022-04-15 06:03:31,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {16109#false} assume 0 == ~cond; {16109#false} is VALID [2022-04-15 06:03:31,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {16109#false} assume !false; {16109#false} is VALID [2022-04-15 06:03:31,479 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:03:31,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:31,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484493688] [2022-04-15 06:03:31,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484493688] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:31,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361254112] [2022-04-15 06:03:31,481 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:03:31,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:31,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:31,482 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:03:31,482 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:03:33,554 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-15 06:03:33,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:33,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-15 06:03:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:33,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:33,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {16108#true} call ULTIMATE.init(); {16108#true} is VALID [2022-04-15 06:03:33,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {16108#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16108#true} is VALID [2022-04-15 06:03:33,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-15 06:03:33,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-15 06:03:33,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {16108#true} call #t~ret4 := main(); {16108#true} is VALID [2022-04-15 06:03:33,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {16108#true} ~x~0 := 268435441; {16113#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:33,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {16113#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16114#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:33,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {16114#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16115#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:33,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {16115#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16116#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:33,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {16116#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16117#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:33,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {16117#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16118#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:33,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {16118#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16119#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:33,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {16119#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16120#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:33,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {16120#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16121#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:33,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {16121#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16122#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:33,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {16122#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16123#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:33,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {16123#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16124#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:33,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {16124#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16125#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:33,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {16125#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16126#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:33,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {16126#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16127#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:33,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {16127#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16128#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:33,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {16128#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16129#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:33,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {16129#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16130#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:33,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {16130#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16131#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:33,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {16131#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16132#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:33,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {16132#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16133#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:33,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {16133#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16134#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:33,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {16134#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16135#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:33,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {16135#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16136#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:33,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {16136#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16137#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:33,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {16137#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16138#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:33,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {16138#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16139#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:33,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {16139#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16140#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:33,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {16140#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16141#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:33,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {16141#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16142#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:33,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {16142#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16143#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:33,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {16143#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16144#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:33,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {16144#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16145#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:33,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {16145#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16146#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:33,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {16146#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16147#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:03:33,942 INFO L290 TraceCheckUtils]: 40: Hoare triple {16147#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16148#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:03:33,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {16148#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16277#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:03:33,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {16277#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {16109#false} is VALID [2022-04-15 06:03:33,943 INFO L272 TraceCheckUtils]: 43: Hoare triple {16109#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16109#false} is VALID [2022-04-15 06:03:33,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {16109#false} ~cond := #in~cond; {16109#false} is VALID [2022-04-15 06:03:33,943 INFO L290 TraceCheckUtils]: 45: Hoare triple {16109#false} assume 0 == ~cond; {16109#false} is VALID [2022-04-15 06:03:33,943 INFO L290 TraceCheckUtils]: 46: Hoare triple {16109#false} assume !false; {16109#false} is VALID [2022-04-15 06:03:33,943 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:03:33,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:36,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {16109#false} assume !false; {16109#false} is VALID [2022-04-15 06:03:36,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {16296#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16109#false} is VALID [2022-04-15 06:03:36,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {16300#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16296#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:03:36,834 INFO L272 TraceCheckUtils]: 43: Hoare triple {16304#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16300#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:03:36,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {16308#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {16304#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:03:36,836 INFO L290 TraceCheckUtils]: 41: Hoare triple {16312#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16308#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {16316#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16312#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {16320#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16316#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {16324#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16320#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {16328#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16324#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {16332#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16328#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {16336#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16332#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {16340#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16336#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {16344#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16340#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {16348#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16344#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {16352#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16348#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {16356#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16352#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {16360#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16356#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {16364#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16360#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {16368#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16364#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {16372#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16368#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {16376#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16372#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {16380#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16376#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {16384#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16380#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {16388#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16384#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {16392#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16388#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {16396#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16392#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {16400#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16396#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {16404#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16400#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {16408#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16404#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {16412#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16408#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {16416#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16412#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {16420#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16416#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {16424#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16420#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {16428#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16424#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {16432#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16428#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {16436#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16432#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {16440#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16436#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {16444#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16440#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {16448#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16444#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {16452#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16448#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {16108#true} ~x~0 := 268435441; {16452#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:36,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {16108#true} call #t~ret4 := main(); {16108#true} is VALID [2022-04-15 06:03:36,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-15 06:03:36,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-15 06:03:36,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {16108#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16108#true} is VALID [2022-04-15 06:03:36,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {16108#true} call ULTIMATE.init(); {16108#true} is VALID [2022-04-15 06:03:36,874 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:03:36,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361254112] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:36,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:36,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 42] total 81 [2022-04-15 06:03:36,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:36,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2027709743] [2022-04-15 06:03:36,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2027709743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:36,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:36,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 06:03:36,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208501168] [2022-04-15 06:03:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:36,876 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:03:36,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:36,876 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:03:36,899 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:03:36,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 06:03:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 06:03:36,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4841, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 06:03:36,900 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:03:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:39,568 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 06:03:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 06:03:39,569 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:03:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:39,569 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:03:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 06:03:39,569 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:03:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 06:03:39,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-15 06:03:39,601 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:39,602 INFO L225 Difference]: With dead ends: 54 [2022-04-15 06:03:39,602 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 06:03:39,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3228, Invalid=10578, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 06:03:39,603 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:39,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:03:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 06:03:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 06:03:39,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:39,658 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:03:39,658 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:03:39,658 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:03:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:39,659 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 06:03:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 06:03:39,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:39,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:39,659 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:03:39,659 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:03:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:39,660 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 06:03:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 06:03:39,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:39,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:39,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:39,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:39,660 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:03:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-15 06:03:39,661 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-15 06:03:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:39,662 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-15 06:03:39,662 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:03:39,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-15 06:03:39,703 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:03:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 06:03:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 06:03:39,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:39,704 INFO L499 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:39,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-04-15 06:03:39,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:40,105 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:03:40,105 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 73 times [2022-04-15 06:03:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:40,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [743926344] [2022-04-15 06:03:40,261 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:40,264 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash 260484599, now seen corresponding path program 1 times [2022-04-15 06:03:40,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:40,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865713068] [2022-04-15 06:03:40,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:40,270 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_37.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:03:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:40,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2035694657] [2022-04-15 06:03:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:40,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:40,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:40,274 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:03:40,275 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:03:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:40,322 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:40,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:40,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 74 times [2022-04-15 06:03:40,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:40,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558902593] [2022-04-15 06:03:40,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:40,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:41,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {16894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16851#true} is VALID [2022-04-15 06:03:41,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-15 06:03:41,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-15 06:03:41,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {16851#true} call ULTIMATE.init(); {16894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:41,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {16894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16851#true} is VALID [2022-04-15 06:03:41,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-15 06:03:41,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-15 06:03:41,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {16851#true} call #t~ret4 := main(); {16851#true} is VALID [2022-04-15 06:03:41,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {16851#true} ~x~0 := 268435441; {16856#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:41,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {16856#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16857#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:41,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {16857#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16858#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:41,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {16858#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16859#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:41,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {16859#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16860#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:41,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {16860#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16861#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:41,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {16861#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16862#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:41,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {16862#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16863#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:41,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {16863#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16864#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:41,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {16864#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16865#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:41,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {16865#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16866#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:41,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {16866#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16867#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:41,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {16867#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16868#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:41,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {16868#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16869#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:41,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {16869#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16870#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:41,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {16870#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16871#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:41,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {16871#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16872#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:41,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {16872#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16873#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:41,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {16873#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16874#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:41,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {16874#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16875#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:41,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {16875#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16876#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:41,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {16876#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16877#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:41,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {16877#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16878#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:41,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {16878#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16879#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:41,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {16879#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16880#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:41,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {16880#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16881#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:41,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {16881#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16882#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:41,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {16882#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16883#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:41,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {16883#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16884#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:41,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {16884#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16885#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:41,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {16885#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16886#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:41,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {16886#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16887#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:41,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {16887#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16888#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:41,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {16888#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16889#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:41,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {16889#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16890#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:03:41,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {16890#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16891#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:03:41,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {16891#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16892#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:03:41,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {16892#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16893#(and (<= (div main_~x~0 4294967296) 0) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:03:41,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {16893#(and (<= (div main_~x~0 4294967296) 0) (<= 268435367 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {16852#false} is VALID [2022-04-15 06:03:41,186 INFO L272 TraceCheckUtils]: 44: Hoare triple {16852#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16852#false} is VALID [2022-04-15 06:03:41,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {16852#false} ~cond := #in~cond; {16852#false} is VALID [2022-04-15 06:03:41,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {16852#false} assume 0 == ~cond; {16852#false} is VALID [2022-04-15 06:03:41,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {16852#false} assume !false; {16852#false} is VALID [2022-04-15 06:03:41,186 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:03:41,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:41,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558902593] [2022-04-15 06:03:41,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558902593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:41,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696094002] [2022-04-15 06:03:41,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:03:41,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:41,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:41,188 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:03:41,189 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:03:41,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:03:41,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:41,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-15 06:03:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:41,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:41,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {16851#true} call ULTIMATE.init(); {16851#true} is VALID [2022-04-15 06:03:41,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {16851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16851#true} is VALID [2022-04-15 06:03:41,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-15 06:03:41,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-15 06:03:41,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {16851#true} call #t~ret4 := main(); {16851#true} is VALID [2022-04-15 06:03:41,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {16851#true} ~x~0 := 268435441; {16856#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:41,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {16856#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16857#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:41,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {16857#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16858#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:41,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {16858#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16859#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:41,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {16859#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16860#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:41,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {16860#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16861#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:41,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {16861#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16862#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:41,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {16862#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16863#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:41,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {16863#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16864#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:41,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {16864#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16865#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:41,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {16865#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16866#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:41,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {16866#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16867#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:41,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {16867#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16868#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:41,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {16868#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16869#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:41,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {16869#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16870#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:41,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {16870#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16871#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:41,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {16871#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16872#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:41,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {16872#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16873#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:41,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {16873#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16874#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:41,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {16874#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16875#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:41,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {16875#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16876#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:41,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {16876#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16877#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:41,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {16877#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16878#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:41,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {16878#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16879#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:41,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {16879#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16880#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:41,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {16880#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16881#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:41,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {16881#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16882#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:41,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {16882#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16883#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:41,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {16883#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16884#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:41,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {16884#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16885#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:41,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {16885#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16886#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:41,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {16886#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16887#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:41,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {16887#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16888#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:41,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {16888#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16889#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:41,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {16889#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16890#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:03:41,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {16890#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16891#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:03:41,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {16891#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {16892#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:03:41,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {16892#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17024#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:03:41,651 INFO L290 TraceCheckUtils]: 43: Hoare triple {17024#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {16852#false} is VALID [2022-04-15 06:03:41,651 INFO L272 TraceCheckUtils]: 44: Hoare triple {16852#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16852#false} is VALID [2022-04-15 06:03:41,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {16852#false} ~cond := #in~cond; {16852#false} is VALID [2022-04-15 06:03:41,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {16852#false} assume 0 == ~cond; {16852#false} is VALID [2022-04-15 06:03:41,651 INFO L290 TraceCheckUtils]: 47: Hoare triple {16852#false} assume !false; {16852#false} is VALID [2022-04-15 06:03:41,651 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:03:41,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:44,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {16852#false} assume !false; {16852#false} is VALID [2022-04-15 06:03:44,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {17043#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16852#false} is VALID [2022-04-15 06:03:44,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {17047#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17043#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:03:44,733 INFO L272 TraceCheckUtils]: 44: Hoare triple {17051#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17047#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:03:44,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {17055#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {17051#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:03:44,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {17059#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17055#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {17063#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17059#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {17067#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17063#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {17071#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17067#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {17075#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17071#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {17079#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17075#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {17083#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17079#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {17087#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17083#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {17091#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17087#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {17095#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17091#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {17099#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17095#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {17103#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17099#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {17107#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17103#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {17111#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17107#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {17115#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17111#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {17119#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17115#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {17123#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17119#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {17127#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17123#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {17131#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17127#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {17135#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17131#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {17139#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17135#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {17143#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17139#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {17147#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17143#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {17151#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17147#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {17155#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17151#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {17159#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17155#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {17163#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17159#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {17167#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17163#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {17171#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17167#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {17175#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17171#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {17179#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17175#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {17183#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17179#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {17187#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17183#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {17191#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17187#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {17195#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17191#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {17199#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17195#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {17203#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17199#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {16851#true} ~x~0 := 268435441; {17203#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:03:44,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {16851#true} call #t~ret4 := main(); {16851#true} is VALID [2022-04-15 06:03:44,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-15 06:03:44,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-15 06:03:44,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {16851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16851#true} is VALID [2022-04-15 06:03:44,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {16851#true} call ULTIMATE.init(); {16851#true} is VALID [2022-04-15 06:03:44,778 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:03:44,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696094002] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:44,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:44,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 43] total 83 [2022-04-15 06:03:44,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:44,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [743926344] [2022-04-15 06:03:44,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [743926344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:44,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:44,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 06:03:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462432401] [2022-04-15 06:03:44,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:44,779 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:03:44,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:44,780 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:03:44,810 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:03:44,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 06:03:44,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:44,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 06:03:44,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=5085, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 06:03:44,811 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:03:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:47,650 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 06:03:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 06:03:47,650 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:03:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:47,651 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:03:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 06:03:47,651 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:03:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 06:03:47,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-15 06:03:47,690 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:47,690 INFO L225 Difference]: With dead ends: 55 [2022-04-15 06:03:47,690 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 06:03:47,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3391, Invalid=11129, Unknown=0, NotChecked=0, Total=14520 [2022-04-15 06:03:47,692 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:47,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:03:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 06:03:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 06:03:47,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:47,743 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:03:47,743 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:03:47,743 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:03:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:47,744 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 06:03:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 06:03:47,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:47,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:47,744 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:03:47,744 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:03:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:47,745 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 06:03:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 06:03:47,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:47,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:47,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:47,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:47,746 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:03:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-15 06:03:47,746 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-15 06:03:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:47,746 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-15 06:03:47,746 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:03:47,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-15 06:03:47,781 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:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 06:03:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 06:03:47,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:47,781 INFO L499 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:47,787 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:03:48,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-04-15 06:03:48,186 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:03:48,186 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:48,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 75 times [2022-04-15 06:03:48,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:48,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1123896678] [2022-04-15 06:03:48,329 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:48,330 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash 319589943, now seen corresponding path program 1 times [2022-04-15 06:03:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:48,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394566509] [2022-04-15 06:03:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:48,336 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_38.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:03:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:48,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196346928] [2022-04-15 06:03:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:48,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:48,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:48,342 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:03:48,343 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:03:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:48,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:48,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 76 times [2022-04-15 06:03:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:48,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089658042] [2022-04-15 06:03:48,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:49,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {17654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17610#true} is VALID [2022-04-15 06:03:49,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {17610#true} assume true; {17610#true} is VALID [2022-04-15 06:03:49,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17610#true} {17610#true} #34#return; {17610#true} is VALID [2022-04-15 06:03:49,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {17610#true} call ULTIMATE.init(); {17654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:49,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {17654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17610#true} is VALID [2022-04-15 06:03:49,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {17610#true} assume true; {17610#true} is VALID [2022-04-15 06:03:49,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17610#true} {17610#true} #34#return; {17610#true} is VALID [2022-04-15 06:03:49,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {17610#true} call #t~ret4 := main(); {17610#true} is VALID [2022-04-15 06:03:49,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {17610#true} ~x~0 := 268435441; {17615#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:49,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {17615#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17616#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:49,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {17616#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17617#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:49,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {17617#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17618#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:49,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {17618#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17619#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:49,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {17619#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17620#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:49,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {17620#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17621#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:49,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {17621#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17622#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:49,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {17622#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17623#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:49,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {17623#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17624#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:49,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {17624#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17625#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:49,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {17625#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17626#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:49,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {17626#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17627#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:49,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {17627#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17628#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:49,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {17628#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17629#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:49,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {17629#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17630#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:49,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {17630#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17631#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:49,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {17631#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17632#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:49,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {17632#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17633#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:49,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {17633#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17634#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:49,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {17634#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17635#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:49,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {17635#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17636#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:49,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {17636#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17637#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:49,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {17637#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17638#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:49,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {17638#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17639#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:49,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {17639#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17640#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:49,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {17640#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17641#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:49,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {17641#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17642#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:49,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {17642#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17643#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:49,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {17643#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17644#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:49,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {17644#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17645#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:49,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {17645#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17646#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:49,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {17646#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17647#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:49,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {17647#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17648#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:49,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {17648#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17649#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:03:49,243 INFO L290 TraceCheckUtils]: 40: Hoare triple {17649#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17650#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:03:49,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {17650#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17651#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:03:49,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {17651#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17652#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:03:49,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {17652#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17653#(and (<= (div main_~x~0 4294967296) 0) (<= 268435365 main_~x~0))} is VALID [2022-04-15 06:03:49,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {17653#(and (<= (div main_~x~0 4294967296) 0) (<= 268435365 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {17611#false} is VALID [2022-04-15 06:03:49,245 INFO L272 TraceCheckUtils]: 45: Hoare triple {17611#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17611#false} is VALID [2022-04-15 06:03:49,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {17611#false} ~cond := #in~cond; {17611#false} is VALID [2022-04-15 06:03:49,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {17611#false} assume 0 == ~cond; {17611#false} is VALID [2022-04-15 06:03:49,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {17611#false} assume !false; {17611#false} is VALID [2022-04-15 06:03:49,245 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:03:49,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:49,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089658042] [2022-04-15 06:03:49,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089658042] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:49,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222607067] [2022-04-15 06:03:49,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:03:49,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:49,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:49,246 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:03:49,247 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:03:49,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:03:49,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:49,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-15 06:03:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:49,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:49,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {17610#true} call ULTIMATE.init(); {17610#true} is VALID [2022-04-15 06:03:49,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {17610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17610#true} is VALID [2022-04-15 06:03:49,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {17610#true} assume true; {17610#true} is VALID [2022-04-15 06:03:49,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17610#true} {17610#true} #34#return; {17610#true} is VALID [2022-04-15 06:03:49,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {17610#true} call #t~ret4 := main(); {17610#true} is VALID [2022-04-15 06:03:49,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {17610#true} ~x~0 := 268435441; {17615#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:49,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {17615#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17616#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:49,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {17616#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17617#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:49,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {17617#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17618#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:49,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {17618#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17619#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:49,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {17619#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17620#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:49,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {17620#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17621#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:49,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {17621#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17622#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:49,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {17622#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17623#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:49,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {17623#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17624#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:49,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {17624#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17625#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:49,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {17625#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17626#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:49,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {17626#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17627#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:49,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {17627#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17628#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:49,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {17628#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17629#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:49,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {17629#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17630#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:49,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {17630#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17631#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:49,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {17631#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17632#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:49,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {17632#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17633#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:49,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {17633#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17634#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:49,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {17634#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17635#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:49,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {17635#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17636#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:49,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {17636#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17637#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:49,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {17637#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17638#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:49,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {17638#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17639#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:49,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {17639#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17640#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:49,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {17640#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17641#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:49,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {17641#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17642#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:49,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {17642#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17643#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:49,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {17643#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17644#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:49,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {17644#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17645#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:49,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {17645#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17646#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:49,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {17646#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17647#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:49,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {17647#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17648#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:49,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {17648#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17649#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:03:49,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {17649#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17650#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:03:49,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {17650#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17651#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:03:49,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {17651#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17652#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:03:49,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {17652#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17787#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:03:49,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {17787#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !(~x~0 % 4294967296 > 1); {17611#false} is VALID [2022-04-15 06:03:49,814 INFO L272 TraceCheckUtils]: 45: Hoare triple {17611#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17611#false} is VALID [2022-04-15 06:03:49,814 INFO L290 TraceCheckUtils]: 46: Hoare triple {17611#false} ~cond := #in~cond; {17611#false} is VALID [2022-04-15 06:03:49,814 INFO L290 TraceCheckUtils]: 47: Hoare triple {17611#false} assume 0 == ~cond; {17611#false} is VALID [2022-04-15 06:03:49,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {17611#false} assume !false; {17611#false} is VALID [2022-04-15 06:03:49,814 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:03:49,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:52,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {17611#false} assume !false; {17611#false} is VALID [2022-04-15 06:03:52,100 INFO L290 TraceCheckUtils]: 47: Hoare triple {17611#false} assume 0 == ~cond; {17611#false} is VALID [2022-04-15 06:03:52,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {17611#false} ~cond := #in~cond; {17611#false} is VALID [2022-04-15 06:03:52,100 INFO L272 TraceCheckUtils]: 45: Hoare triple {17611#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17611#false} is VALID [2022-04-15 06:03:52,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {17815#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {17611#false} is VALID [2022-04-15 06:03:52,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {17819#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17815#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:03:52,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {17823#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17819#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:03:52,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {17827#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17823#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {17831#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17827#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {17835#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17831#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {17839#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17835#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:03:52,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {17843#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17839#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:03:52,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {17847#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17843#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {17851#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17847#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:03:52,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {17855#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17851#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:03:52,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {17859#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17855#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {17863#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17859#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {17867#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17863#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {17871#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17867#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:03:52,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {17875#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17871#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:03:52,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {17879#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17875#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:03:52,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {17883#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17879#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:03:52,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {17887#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17883#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:03:52,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {17891#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17887#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {17895#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17891#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:03:52,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {17899#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17895#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:03:52,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {17903#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17899#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {17907#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17903#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:03:52,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {17911#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17907#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {17915#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17911#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:03:52,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {17919#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17915#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {17923#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17919#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:03:52,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {17927#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17923#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:03:52,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {17931#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17927#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {17935#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17931#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {17939#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17935#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:03:52,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {17943#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17939#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:03:52,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {17947#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17943#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:03:52,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {17951#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17947#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {17955#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17951#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:03:52,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {17959#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17955#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:03:52,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {17963#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17959#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:03:52,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {17967#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {17963#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:03:52,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {17610#true} ~x~0 := 268435441; {17967#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:03:52,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {17610#true} call #t~ret4 := main(); {17610#true} is VALID [2022-04-15 06:03:52,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17610#true} {17610#true} #34#return; {17610#true} is VALID [2022-04-15 06:03:52,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {17610#true} assume true; {17610#true} is VALID [2022-04-15 06:03:52,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {17610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17610#true} is VALID [2022-04-15 06:03:52,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {17610#true} call ULTIMATE.init(); {17610#true} is VALID [2022-04-15 06:03:52,135 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:03:52,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222607067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:52,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:52,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2022-04-15 06:03:52,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:52,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1123896678] [2022-04-15 06:03:52,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1123896678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:52,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:52,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 06:03:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80437316] [2022-04-15 06:03:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:52,136 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:52,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:52,136 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:03:52,161 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:03:52,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 06:03:52,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:52,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 06:03:52,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1760, Invalid=4882, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:03:52,162 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:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:55,130 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 06:03:55,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 06:03:55,130 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:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:55,130 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:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-15 06:03:55,131 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:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-15 06:03:55,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-15 06:03:55,177 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:55,177 INFO L225 Difference]: With dead ends: 56 [2022-04-15 06:03:55,178 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 06:03:55,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3513, Invalid=11007, Unknown=0, NotChecked=0, Total=14520 [2022-04-15 06:03:55,179 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:55,179 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:03:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 06:03:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 06:03:55,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:55,232 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:55,232 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:55,232 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:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:55,232 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 06:03:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 06:03:55,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:55,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:55,233 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:55,233 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:55,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:55,233 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 06:03:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 06:03:55,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:55,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:55,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:55,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:55,234 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:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-15 06:03:55,234 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-15 06:03:55,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:55,235 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-15 06:03:55,235 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:55,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-15 06:03:55,273 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:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 06:03:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 06:03:55,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:55,273 INFO L499 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:55,279 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:55,490 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:55,674 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:55,674 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:55,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:55,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 77 times [2022-04-15 06:03:55,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:55,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1423459127] [2022-04-15 06:03:55,797 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:55,798 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:03:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash 378695287, now seen corresponding path program 1 times [2022-04-15 06:03:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:55,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231761438] [2022-04-15 06:03:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:55,804 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_39.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:03:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:03:55,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563778413] [2022-04-15 06:03:55,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:55,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:55,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:55,808 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:55,809 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:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:55,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:03:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:03:55,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:03:55,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 78 times [2022-04-15 06:03:55,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:55,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714438909] [2022-04-15 06:03:55,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:55,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:56,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:56,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {18427#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18382#true} is VALID [2022-04-15 06:03:56,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {18382#true} assume true; {18382#true} is VALID [2022-04-15 06:03:56,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18382#true} {18382#true} #34#return; {18382#true} is VALID [2022-04-15 06:03:56,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {18382#true} call ULTIMATE.init(); {18427#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:56,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {18427#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18382#true} is VALID [2022-04-15 06:03:56,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {18382#true} assume true; {18382#true} is VALID [2022-04-15 06:03:56,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18382#true} {18382#true} #34#return; {18382#true} is VALID [2022-04-15 06:03:56,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {18382#true} call #t~ret4 := main(); {18382#true} is VALID [2022-04-15 06:03:56,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {18382#true} ~x~0 := 268435441; {18387#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:03:56,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {18387#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18388#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:03:56,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {18388#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18389#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:03:56,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {18389#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18390#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:03:56,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {18390#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18391#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:03:56,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {18391#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18392#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:03:56,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {18392#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18393#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:03:56,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {18393#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18394#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:03:56,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {18394#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18395#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:03:56,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {18395#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18396#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:03:56,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {18396#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18397#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:03:56,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {18397#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18398#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:03:56,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {18398#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18399#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:03:56,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {18399#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18400#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:03:56,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {18400#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18401#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:03:56,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {18401#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18402#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:03:56,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {18402#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18403#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:03:56,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {18403#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18404#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:03:56,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {18404#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18405#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:03:56,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {18405#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18406#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:03:56,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {18406#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18407#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:03:56,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {18407#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18408#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:03:56,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {18408#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18409#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:03:56,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {18409#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18410#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:03:56,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {18410#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18411#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:03:56,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {18411#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18412#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:03:56,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {18412#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18413#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:03:56,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {18413#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18414#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:03:56,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {18414#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18415#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:03:56,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {18415#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18416#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:03:56,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {18416#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18417#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:03:56,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {18417#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18418#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:03:56,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {18418#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18419#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:03:56,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {18419#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18420#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:03:56,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {18420#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18421#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:03:56,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {18421#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18422#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:03:56,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {18422#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18423#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:03:56,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {18423#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18424#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:03:56,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {18424#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18425#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:03:56,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {18425#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18426#(and (<= 268435363 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:03:56,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {18426#(and (<= 268435363 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {18383#false} is VALID [2022-04-15 06:03:56,715 INFO L272 TraceCheckUtils]: 46: Hoare triple {18383#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18383#false} is VALID [2022-04-15 06:03:56,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {18383#false} ~cond := #in~cond; {18383#false} is VALID [2022-04-15 06:03:56,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {18383#false} assume 0 == ~cond; {18383#false} is VALID [2022-04-15 06:03:56,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {18383#false} assume !false; {18383#false} is VALID [2022-04-15 06:03:56,715 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:56,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:56,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714438909] [2022-04-15 06:03:56,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714438909] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:56,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955070573] [2022-04-15 06:03:56,715 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:03:56,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:56,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:56,716 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:56,717 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:59,587 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-04-15 06:03:59,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:59,591 WARN L261 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-15 06:03:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:59,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:00,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {18382#true} call ULTIMATE.init(); {18382#true} is VALID [2022-04-15 06:04:00,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {18382#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18382#true} is VALID [2022-04-15 06:04:00,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {18382#true} assume true; {18382#true} is VALID [2022-04-15 06:04:00,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18382#true} {18382#true} #34#return; {18382#true} is VALID [2022-04-15 06:04:00,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {18382#true} call #t~ret4 := main(); {18382#true} is VALID [2022-04-15 06:04:00,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {18382#true} ~x~0 := 268435441; {18387#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:00,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {18387#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18388#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:00,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {18388#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18389#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:00,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {18389#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18390#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:00,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {18390#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18391#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:00,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {18391#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18392#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:00,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {18392#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18393#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:00,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {18393#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18394#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:00,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {18394#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18395#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:00,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {18395#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18396#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:00,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {18396#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18397#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:00,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {18397#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18398#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:00,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {18398#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18399#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:00,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {18399#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18400#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:00,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {18400#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18401#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:00,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {18401#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18402#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:00,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {18402#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18403#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:00,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {18403#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18404#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:00,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {18404#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18405#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:00,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {18405#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18406#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:00,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {18406#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18407#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:00,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {18407#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18408#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:00,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {18408#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18409#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:00,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {18409#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18410#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:00,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {18410#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18411#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:00,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {18411#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18412#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:00,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {18412#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18413#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:00,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {18413#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18414#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:00,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {18414#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18415#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:00,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {18415#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18416#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:00,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {18416#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18417#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:00,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {18417#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18418#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:00,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {18418#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18419#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:00,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {18419#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18420#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:00,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {18420#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18421#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:00,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {18421#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18422#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:00,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {18422#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18423#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:00,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {18423#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18424#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:00,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {18424#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18425#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:00,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {18425#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18563#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:00,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {18563#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !(~x~0 % 4294967296 > 1); {18383#false} is VALID [2022-04-15 06:04:00,021 INFO L272 TraceCheckUtils]: 46: Hoare triple {18383#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18383#false} is VALID [2022-04-15 06:04:00,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {18383#false} ~cond := #in~cond; {18383#false} is VALID [2022-04-15 06:04:00,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {18383#false} assume 0 == ~cond; {18383#false} is VALID [2022-04-15 06:04:00,021 INFO L290 TraceCheckUtils]: 49: Hoare triple {18383#false} assume !false; {18383#false} is VALID [2022-04-15 06:04:00,021 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:04:00,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:03,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {18383#false} assume !false; {18383#false} is VALID [2022-04-15 06:04:03,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {18582#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18383#false} is VALID [2022-04-15 06:04:03,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {18586#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18582#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:04:03,367 INFO L272 TraceCheckUtils]: 46: Hoare triple {18590#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18586#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:04:03,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {18594#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {18590#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:04:03,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {18598#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18594#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {18602#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18598#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {18606#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18602#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {18610#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18606#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {18614#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18610#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {18618#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18614#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {18622#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18618#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {18626#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18622#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {18630#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18626#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {18634#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18630#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {18638#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18634#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {18642#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18638#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {18646#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18642#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {18650#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18646#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {18654#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18650#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {18658#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18654#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {18662#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18658#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {18666#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18662#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {18670#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18666#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {18674#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18670#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {18678#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18674#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {18682#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18678#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {18686#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18682#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {18690#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18686#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {18694#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18690#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {18698#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18694#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {18702#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18698#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {18706#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18702#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {18710#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18706#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {18714#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18710#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {18718#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18714#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {18722#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18718#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {18726#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18722#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {18730#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18726#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {18734#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18730#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {18738#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18734#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {18742#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18738#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {18746#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18742#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {18750#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {18746#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {18382#true} ~x~0 := 268435441; {18750#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:03,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {18382#true} call #t~ret4 := main(); {18382#true} is VALID [2022-04-15 06:04:03,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18382#true} {18382#true} #34#return; {18382#true} is VALID [2022-04-15 06:04:03,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {18382#true} assume true; {18382#true} is VALID [2022-04-15 06:04:03,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {18382#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18382#true} is VALID [2022-04-15 06:04:03,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {18382#true} call ULTIMATE.init(); {18382#true} is VALID [2022-04-15 06:04:03,409 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:04:03,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955070573] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:03,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:03,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 45] total 87 [2022-04-15 06:04:03,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:03,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1423459127] [2022-04-15 06:04:03,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1423459127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:03,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:03,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 06:04:03,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278153925] [2022-04-15 06:04:03,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:03,410 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:04:03,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:03,410 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:04:03,437 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:04:03,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 06:04:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:03,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 06:04:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5591, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 06:04:03,438 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:04:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:06,543 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-15 06:04:06,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 06:04:06,543 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:04:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:06,543 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:04:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-15 06:04:06,544 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:04:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-15 06:04:06,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 57 transitions. [2022-04-15 06:04:06,594 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:06,595 INFO L225 Difference]: With dead ends: 57 [2022-04-15 06:04:06,595 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 06:04:06,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3729, Invalid=12273, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 06:04:06,597 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:06,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:04:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 06:04:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 06:04:06,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:06,657 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:04:06,657 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:04:06,657 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:04:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:06,658 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 06:04:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 06:04:06,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:06,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:06,658 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:04:06,658 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:04:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:06,659 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 06:04:06,659 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 06:04:06,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:06,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:06,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:06,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:06,659 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:04:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-15 06:04:06,659 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-15 06:04:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:06,660 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-15 06:04:06,660 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:04:06,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-15 06:04:06,699 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:04:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 06:04:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 06:04:06,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:06,699 INFO L499 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:06,703 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:04:06,908 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:04:07,103 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:04:07,104 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:07,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1557621980, now seen corresponding path program 79 times [2022-04-15 06:04:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:07,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [91980120] [2022-04-15 06:04:07,229 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:07,231 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:04:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash 437800631, now seen corresponding path program 1 times [2022-04-15 06:04:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:07,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990864962] [2022-04-15 06:04:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:07,236 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_40.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:04:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:04:07,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664385597] [2022-04-15 06:04:07,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:07,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:07,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:07,241 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:04:07,241 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:04:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:07,277 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:04:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:07,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:04:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1557621980, now seen corresponding path program 80 times [2022-04-15 06:04:07,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:07,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272125489] [2022-04-15 06:04:07,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:08,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:08,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {19219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19173#true} is VALID [2022-04-15 06:04:08,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {19173#true} assume true; {19173#true} is VALID [2022-04-15 06:04:08,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19173#true} {19173#true} #34#return; {19173#true} is VALID [2022-04-15 06:04:08,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {19173#true} call ULTIMATE.init(); {19219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:08,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {19219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19173#true} is VALID [2022-04-15 06:04:08,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {19173#true} assume true; {19173#true} is VALID [2022-04-15 06:04:08,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19173#true} {19173#true} #34#return; {19173#true} is VALID [2022-04-15 06:04:08,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {19173#true} call #t~ret4 := main(); {19173#true} is VALID [2022-04-15 06:04:08,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {19173#true} ~x~0 := 268435441; {19178#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:08,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {19178#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19179#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:08,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {19179#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19180#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:08,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {19180#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19181#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:08,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {19181#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19182#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:08,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {19182#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19183#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:08,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {19183#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19184#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:08,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {19184#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19185#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:08,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {19185#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19186#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:08,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {19186#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19187#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:08,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {19187#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19188#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:08,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {19188#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19189#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:08,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {19189#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19190#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:08,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {19190#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19191#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:08,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {19191#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19192#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:08,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {19192#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19193#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:08,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {19193#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19194#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:08,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {19194#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19195#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:08,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {19195#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19196#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:08,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {19196#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19197#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:08,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {19197#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19198#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:08,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {19198#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19199#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:08,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {19199#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19200#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:08,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {19200#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19201#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:08,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {19201#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19202#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:08,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {19202#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19203#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:08,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {19203#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19204#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:08,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {19204#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19205#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:08,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {19205#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19206#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:08,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {19206#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19207#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:08,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {19207#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19208#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:08,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {19208#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19209#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:08,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {19209#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19210#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:08,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {19210#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19211#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:08,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {19211#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19212#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:08,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {19212#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19213#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:08,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {19213#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19214#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:08,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {19214#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19215#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:08,214 INFO L290 TraceCheckUtils]: 43: Hoare triple {19215#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19216#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:08,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {19216#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19217#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:08,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {19217#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19218#(and (<= (div main_~x~0 4294967296) 0) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:04:08,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {19218#(and (<= (div main_~x~0 4294967296) 0) (<= 268435361 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {19174#false} is VALID [2022-04-15 06:04:08,215 INFO L272 TraceCheckUtils]: 47: Hoare triple {19174#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19174#false} is VALID [2022-04-15 06:04:08,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {19174#false} ~cond := #in~cond; {19174#false} is VALID [2022-04-15 06:04:08,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {19174#false} assume 0 == ~cond; {19174#false} is VALID [2022-04-15 06:04:08,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {19174#false} assume !false; {19174#false} is VALID [2022-04-15 06:04:08,216 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:04:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:08,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272125489] [2022-04-15 06:04:08,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272125489] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:08,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278188063] [2022-04-15 06:04:08,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:04:08,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:08,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:08,217 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:04:08,218 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:04:08,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:04:08,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:08,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-15 06:04:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:08,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:08,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {19173#true} call ULTIMATE.init(); {19173#true} is VALID [2022-04-15 06:04:08,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {19173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19173#true} is VALID [2022-04-15 06:04:08,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {19173#true} assume true; {19173#true} is VALID [2022-04-15 06:04:08,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19173#true} {19173#true} #34#return; {19173#true} is VALID [2022-04-15 06:04:08,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {19173#true} call #t~ret4 := main(); {19173#true} is VALID [2022-04-15 06:04:08,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {19173#true} ~x~0 := 268435441; {19178#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:08,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {19178#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19179#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:08,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {19179#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19180#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:08,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {19180#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19181#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:08,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {19181#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19182#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:08,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {19182#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19183#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:08,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {19183#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19184#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:08,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {19184#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19185#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:08,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {19185#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19186#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:08,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {19186#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19187#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:08,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {19187#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19188#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:08,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {19188#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19189#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:08,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {19189#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19190#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:08,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {19190#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19191#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:08,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {19191#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19192#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:08,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {19192#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19193#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:08,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {19193#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19194#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:08,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {19194#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19195#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:08,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {19195#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19196#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:08,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {19196#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19197#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:08,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {19197#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19198#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:08,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {19198#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19199#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:08,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {19199#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19200#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:08,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {19200#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19201#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:08,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {19201#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19202#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:08,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {19202#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19203#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:08,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {19203#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19204#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:08,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {19204#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19205#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:08,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {19205#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19206#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:08,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {19206#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19207#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:08,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {19207#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19208#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:08,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {19208#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19209#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:08,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {19209#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19210#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:08,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {19210#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19211#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:08,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {19211#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19212#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:08,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {19212#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19213#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:08,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {19213#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19214#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:08,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {19214#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19215#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:08,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {19215#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19216#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:08,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {19216#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19217#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:08,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {19217#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19358#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:04:08,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {19358#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {19174#false} is VALID [2022-04-15 06:04:08,793 INFO L272 TraceCheckUtils]: 47: Hoare triple {19174#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19174#false} is VALID [2022-04-15 06:04:08,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {19174#false} ~cond := #in~cond; {19174#false} is VALID [2022-04-15 06:04:08,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {19174#false} assume 0 == ~cond; {19174#false} is VALID [2022-04-15 06:04:08,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {19174#false} assume !false; {19174#false} is VALID [2022-04-15 06:04:08,793 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:04:08,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:11,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {19174#false} assume !false; {19174#false} is VALID [2022-04-15 06:04:11,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {19174#false} assume 0 == ~cond; {19174#false} is VALID [2022-04-15 06:04:11,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {19174#false} ~cond := #in~cond; {19174#false} is VALID [2022-04-15 06:04:11,317 INFO L272 TraceCheckUtils]: 47: Hoare triple {19174#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19174#false} is VALID [2022-04-15 06:04:11,317 INFO L290 TraceCheckUtils]: 46: Hoare triple {19386#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {19174#false} is VALID [2022-04-15 06:04:11,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {19390#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19386#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:04:11,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {19394#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19390#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:04:11,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {19398#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19394#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {19402#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19398#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {19406#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19402#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {19410#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19406#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:04:11,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {19414#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19410#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:04:11,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {19418#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19414#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {19422#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19418#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:04:11,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {19426#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19422#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:04:11,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {19430#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19426#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {19434#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19430#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {19438#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19434#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {19442#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19438#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:04:11,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {19446#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19442#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:04:11,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {19450#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19446#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:04:11,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {19454#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19450#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:04:11,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {19458#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19454#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:04:11,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {19462#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19458#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {19466#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19462#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:04:11,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {19470#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19466#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:04:11,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {19474#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19470#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {19478#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19474#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:04:11,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {19482#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19478#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {19486#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19482#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:04:11,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {19490#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19486#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {19494#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19490#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:04:11,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {19498#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19494#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:04:11,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {19502#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19498#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {19506#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19502#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {19510#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19506#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:04:11,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {19514#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19510#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:04:11,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {19518#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19514#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:04:11,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {19522#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19518#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {19526#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19522#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:04:11,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {19530#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19526#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:04:11,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {19534#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19530#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {19538#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19534#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:04:11,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {19542#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19538#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:04:11,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {19546#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19542#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {19173#true} ~x~0 := 268435441; {19546#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:11,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {19173#true} call #t~ret4 := main(); {19173#true} is VALID [2022-04-15 06:04:11,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19173#true} {19173#true} #34#return; {19173#true} is VALID [2022-04-15 06:04:11,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {19173#true} assume true; {19173#true} is VALID [2022-04-15 06:04:11,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {19173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19173#true} is VALID [2022-04-15 06:04:11,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {19173#true} call ULTIMATE.init(); {19173#true} is VALID [2022-04-15 06:04:11,347 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:04:11,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278188063] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:11,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:11,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-15 06:04:11,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:11,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [91980120] [2022-04-15 06:04:11,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [91980120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:11,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:11,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 06:04:11,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500435801] [2022-04-15 06:04:11,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:11,348 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:04:11,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:11,348 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:04:11,382 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:04:11,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 06:04:11,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:11,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 06:04:11,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1932, Invalid=5378, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 06:04:11,383 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:04:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:14,668 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 06:04:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 06:04:14,668 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:04:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:14,668 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:04:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-15 06:04:14,669 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:04:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-15 06:04:14,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 58 transitions. [2022-04-15 06:04:14,715 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:14,715 INFO L225 Difference]: With dead ends: 58 [2022-04-15 06:04:14,715 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:04:14,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3857, Invalid=12145, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 06:04:14,716 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:14,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 06:04:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:04:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 06:04:14,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:14,771 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:04:14,771 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:04:14,771 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:04:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:14,772 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 06:04:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 06:04:14,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:14,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:14,772 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:04:14,772 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:04:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:14,772 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 06:04:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 06:04:14,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:14,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:14,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:14,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:14,773 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:04:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-15 06:04:14,773 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2022-04-15 06:04:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:14,773 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-15 06:04:14,773 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:04:14,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-15 06:04:14,813 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:04:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 06:04:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 06:04:14,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:14,814 INFO L499 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:14,820 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:04:15,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2022-04-15 06:04:15,214 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:04:15,214 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:15,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1078102390, now seen corresponding path program 81 times [2022-04-15 06:04:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:15,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [363173116] [2022-04-15 06:04:15,344 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:15,345 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:04:15,347 INFO L85 PathProgramCache]: Analyzing trace with hash 496905975, now seen corresponding path program 1 times [2022-04-15 06:04:15,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:15,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753686318] [2022-04-15 06:04:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:15,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:15,351 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_41.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:04:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:04:15,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737731392] [2022-04-15 06:04:15,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:15,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:15,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:15,355 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:04:15,356 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:04:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:15,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:04:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:15,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:04:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1078102390, now seen corresponding path program 82 times [2022-04-15 06:04:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:15,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595047549] [2022-04-15 06:04:15,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:16,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:16,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {20024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19977#true} is VALID [2022-04-15 06:04:16,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {19977#true} assume true; {19977#true} is VALID [2022-04-15 06:04:16,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19977#true} {19977#true} #34#return; {19977#true} is VALID [2022-04-15 06:04:16,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {19977#true} call ULTIMATE.init(); {20024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:16,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {20024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19977#true} is VALID [2022-04-15 06:04:16,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {19977#true} assume true; {19977#true} is VALID [2022-04-15 06:04:16,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19977#true} {19977#true} #34#return; {19977#true} is VALID [2022-04-15 06:04:16,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {19977#true} call #t~ret4 := main(); {19977#true} is VALID [2022-04-15 06:04:16,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {19977#true} ~x~0 := 268435441; {19982#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:16,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {19982#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19983#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:16,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {19983#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19984#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:16,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {19984#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19985#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:16,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {19985#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19986#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:16,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {19986#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19987#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:16,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {19987#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19988#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:16,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {19988#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19989#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:16,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {19989#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19990#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:16,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {19990#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19991#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:16,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {19991#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19992#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:16,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {19992#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19993#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:16,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {19993#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19994#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:16,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {19994#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19995#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:16,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {19995#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19996#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:16,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {19996#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19997#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:16,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {19997#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19998#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:16,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {19998#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19999#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:16,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {19999#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20000#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:16,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {20000#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20001#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:16,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {20001#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20002#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:16,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {20002#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20003#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:16,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {20003#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20004#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:16,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {20004#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20005#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:16,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {20005#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20006#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:16,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {20006#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20007#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:16,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {20007#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20008#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:16,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {20008#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20009#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:16,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {20009#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20010#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:16,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {20010#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20011#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:16,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {20011#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20012#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:16,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {20012#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20013#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:16,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {20013#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20014#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:16,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {20014#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20015#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:16,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {20015#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20016#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:16,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {20016#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20017#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:16,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {20017#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20018#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:16,427 INFO L290 TraceCheckUtils]: 42: Hoare triple {20018#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20019#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:16,427 INFO L290 TraceCheckUtils]: 43: Hoare triple {20019#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20020#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:16,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {20020#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20021#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:16,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {20021#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20022#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:04:16,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {20022#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20023#(and (<= (div main_~x~0 4294967296) 0) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:04:16,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {20023#(and (<= (div main_~x~0 4294967296) 0) (<= 268435359 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {19978#false} is VALID [2022-04-15 06:04:16,429 INFO L272 TraceCheckUtils]: 48: Hoare triple {19978#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19978#false} is VALID [2022-04-15 06:04:16,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {19978#false} ~cond := #in~cond; {19978#false} is VALID [2022-04-15 06:04:16,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {19978#false} assume 0 == ~cond; {19978#false} is VALID [2022-04-15 06:04:16,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {19978#false} assume !false; {19978#false} is VALID [2022-04-15 06:04:16,430 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:04:16,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:16,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595047549] [2022-04-15 06:04:16,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595047549] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:16,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933977363] [2022-04-15 06:04:16,430 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:04:16,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:16,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:16,431 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:04:16,432 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:04:16,553 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:04:16,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:16,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-15 06:04:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:16,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:17,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {19977#true} call ULTIMATE.init(); {19977#true} is VALID [2022-04-15 06:04:17,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {19977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19977#true} is VALID [2022-04-15 06:04:17,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {19977#true} assume true; {19977#true} is VALID [2022-04-15 06:04:17,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19977#true} {19977#true} #34#return; {19977#true} is VALID [2022-04-15 06:04:17,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {19977#true} call #t~ret4 := main(); {19977#true} is VALID [2022-04-15 06:04:17,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {19977#true} ~x~0 := 268435441; {19982#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:17,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {19982#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19983#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:17,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {19983#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19984#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:17,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {19984#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19985#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:17,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {19985#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19986#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:17,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {19986#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19987#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:17,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {19987#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19988#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:17,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {19988#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19989#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:17,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {19989#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19990#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:17,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {19990#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19991#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:17,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {19991#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19992#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:17,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {19992#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19993#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:17,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {19993#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19994#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:17,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {19994#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19995#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:17,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {19995#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19996#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:17,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {19996#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19997#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:17,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {19997#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19998#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:17,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {19998#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {19999#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:17,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {19999#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20000#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:17,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {20000#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20001#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:17,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {20001#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20002#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:17,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {20002#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20003#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:17,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {20003#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20004#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:17,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {20004#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20005#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:17,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {20005#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20006#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:17,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {20006#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20007#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:17,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {20007#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20008#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:17,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {20008#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20009#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:17,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {20009#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20010#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:17,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {20010#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20011#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:17,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {20011#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20012#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:17,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {20012#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20013#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:17,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {20013#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20014#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:17,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {20014#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20015#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:17,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {20015#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20016#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:17,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {20016#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20017#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:17,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {20017#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20018#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:17,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {20018#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20019#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:17,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {20019#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20020#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:17,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {20020#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20021#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:17,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {20021#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20022#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:04:17,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {20022#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20166#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:04:17,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {20166#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {19978#false} is VALID [2022-04-15 06:04:17,081 INFO L272 TraceCheckUtils]: 48: Hoare triple {19978#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19978#false} is VALID [2022-04-15 06:04:17,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {19978#false} ~cond := #in~cond; {19978#false} is VALID [2022-04-15 06:04:17,081 INFO L290 TraceCheckUtils]: 50: Hoare triple {19978#false} assume 0 == ~cond; {19978#false} is VALID [2022-04-15 06:04:17,082 INFO L290 TraceCheckUtils]: 51: Hoare triple {19978#false} assume !false; {19978#false} is VALID [2022-04-15 06:04:17,082 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:04:17,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:19,797 INFO L290 TraceCheckUtils]: 51: Hoare triple {19978#false} assume !false; {19978#false} is VALID [2022-04-15 06:04:19,797 INFO L290 TraceCheckUtils]: 50: Hoare triple {19978#false} assume 0 == ~cond; {19978#false} is VALID [2022-04-15 06:04:19,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {19978#false} ~cond := #in~cond; {19978#false} is VALID [2022-04-15 06:04:19,797 INFO L272 TraceCheckUtils]: 48: Hoare triple {19978#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19978#false} is VALID [2022-04-15 06:04:19,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {20194#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {19978#false} is VALID [2022-04-15 06:04:19,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {20198#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20194#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:04:19,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {20202#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20198#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:04:19,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {20206#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20202#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {20210#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20206#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {20214#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20210#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {20218#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20214#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:04:19,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {20222#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20218#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:04:19,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {20226#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20222#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {20230#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20226#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:04:19,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {20234#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20230#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:04:19,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {20238#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20234#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {20242#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20238#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {20246#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20242#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {20250#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20246#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:04:19,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {20254#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20250#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:04:19,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {20258#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20254#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:04:19,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {20262#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20258#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:04:19,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {20266#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20262#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:04:19,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {20270#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20266#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {20274#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20270#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:04:19,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {20278#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20274#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:04:19,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {20282#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20278#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {20286#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20282#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:04:19,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {20290#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20286#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {20294#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20290#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:04:19,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {20298#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20294#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {20302#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20298#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:04:19,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {20306#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20302#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:04:19,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {20310#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20306#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {20314#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20310#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {20318#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20314#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:04:19,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {20322#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20318#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:04:19,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {20326#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20322#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:04:19,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {20330#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20326#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {20334#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20330#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:04:19,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {20338#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20334#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:04:19,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {20342#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20338#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {20346#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20342#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:04:19,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {20350#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20346#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:04:19,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {20354#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20350#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {20358#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20354#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:19,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {19977#true} ~x~0 := 268435441; {20358#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} is VALID [2022-04-15 06:04:19,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {19977#true} call #t~ret4 := main(); {19977#true} is VALID [2022-04-15 06:04:19,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19977#true} {19977#true} #34#return; {19977#true} is VALID [2022-04-15 06:04:19,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {19977#true} assume true; {19977#true} is VALID [2022-04-15 06:04:19,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {19977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19977#true} is VALID [2022-04-15 06:04:19,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {19977#true} call ULTIMATE.init(); {19977#true} is VALID [2022-04-15 06:04:19,840 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:04:19,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933977363] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:19,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:19,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 88 [2022-04-15 06:04:19,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:19,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [363173116] [2022-04-15 06:04:19,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [363173116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:19,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:19,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 06:04:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93504781] [2022-04-15 06:04:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:19,841 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:04:19,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:19,841 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:04:19,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:04:19,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 06:04:19,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:19,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 06:04:19,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2021, Invalid=5635, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 06:04:19,870 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:04:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:23,420 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 06:04:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 06:04:23,420 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:04:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:23,420 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:04:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-15 06:04:23,421 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:04:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-15 06:04:23,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-15 06:04:23,455 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:23,456 INFO L225 Difference]: With dead ends: 59 [2022-04-15 06:04:23,456 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 06:04:23,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4035, Invalid=12735, Unknown=0, NotChecked=0, Total=16770 [2022-04-15 06:04:23,457 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:23,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:04:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 06:04:23,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 06:04:23,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:23,511 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:04:23,511 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:04:23,511 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:04:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:23,512 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 06:04:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 06:04:23,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:23,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:23,512 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:04:23,513 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:04:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:23,513 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 06:04:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 06:04:23,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:23,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:23,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:23,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:23,513 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:04:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-15 06:04:23,514 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2022-04-15 06:04:23,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:23,514 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-15 06:04:23,514 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:04:23,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 54 transitions. [2022-04-15 06:04:23,565 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:04:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 06:04:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 06:04:23,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:23,566 INFO L499 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:23,583 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:04:23,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-04-15 06:04:23,982 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:04:23,982 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:23,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash -902103012, now seen corresponding path program 83 times [2022-04-15 06:04:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:23,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848939976] [2022-04-15 06:04:24,112 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:24,113 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:04:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 556011319, now seen corresponding path program 1 times [2022-04-15 06:04:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:24,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145860440] [2022-04-15 06:04:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:24,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:24,118 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_42.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:04:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:04:24,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698462331] [2022-04-15 06:04:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:24,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:24,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:24,122 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:04:24,123 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:04:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:24,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:04:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:24,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:04:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash -902103012, now seen corresponding path program 84 times [2022-04-15 06:04:24,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:24,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067696923] [2022-04-15 06:04:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:25,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {20845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20797#true} is VALID [2022-04-15 06:04:25,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {20797#true} assume true; {20797#true} is VALID [2022-04-15 06:04:25,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20797#true} {20797#true} #34#return; {20797#true} is VALID [2022-04-15 06:04:25,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {20797#true} call ULTIMATE.init(); {20845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:25,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {20845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20797#true} is VALID [2022-04-15 06:04:25,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {20797#true} assume true; {20797#true} is VALID [2022-04-15 06:04:25,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20797#true} {20797#true} #34#return; {20797#true} is VALID [2022-04-15 06:04:25,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {20797#true} call #t~ret4 := main(); {20797#true} is VALID [2022-04-15 06:04:25,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {20797#true} ~x~0 := 268435441; {20802#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:25,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {20802#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20803#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:25,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {20803#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20804#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:25,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {20804#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20805#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:25,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {20805#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20806#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:25,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {20806#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20807#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:25,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {20807#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20808#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:25,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {20808#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20809#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:25,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {20809#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20810#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:25,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {20810#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20811#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:25,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {20811#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20812#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:25,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {20812#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20813#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:25,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {20813#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20814#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:25,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {20814#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20815#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:25,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {20815#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20816#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:25,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {20816#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20817#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:25,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {20817#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20818#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:25,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {20818#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20819#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:25,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {20819#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20820#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:25,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {20820#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20821#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:25,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {20821#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20822#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:25,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {20822#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20823#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:25,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {20823#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20824#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:25,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {20824#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20825#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:25,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {20825#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20826#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:25,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {20826#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20827#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:25,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {20827#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20828#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:25,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {20828#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20829#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:25,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {20829#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20830#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:25,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {20830#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20831#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:25,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {20831#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20832#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:25,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {20832#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20833#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:25,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {20833#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20834#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:25,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {20834#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20835#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:25,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {20835#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20836#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:25,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {20836#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20837#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:25,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {20837#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20838#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:25,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {20838#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20839#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:25,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {20839#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20840#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:25,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {20840#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20841#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:25,201 INFO L290 TraceCheckUtils]: 45: Hoare triple {20841#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20842#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:04:25,201 INFO L290 TraceCheckUtils]: 46: Hoare triple {20842#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20843#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:04:25,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {20843#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20844#(and (<= (div main_~x~0 4294967296) 0) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:04:25,202 INFO L290 TraceCheckUtils]: 48: Hoare triple {20844#(and (<= (div main_~x~0 4294967296) 0) (<= 268435357 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {20798#false} is VALID [2022-04-15 06:04:25,202 INFO L272 TraceCheckUtils]: 49: Hoare triple {20798#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {20798#false} is VALID [2022-04-15 06:04:25,202 INFO L290 TraceCheckUtils]: 50: Hoare triple {20798#false} ~cond := #in~cond; {20798#false} is VALID [2022-04-15 06:04:25,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {20798#false} assume 0 == ~cond; {20798#false} is VALID [2022-04-15 06:04:25,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {20798#false} assume !false; {20798#false} is VALID [2022-04-15 06:04:25,203 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:04:25,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:25,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067696923] [2022-04-15 06:04:25,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067696923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:25,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187737353] [2022-04-15 06:04:25,203 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:04:25,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:25,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:25,204 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:04:25,207 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:04:28,102 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-15 06:04:28,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:28,106 WARN L261 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 90 conjunts are in the unsatisfiable core [2022-04-15 06:04:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:28,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:28,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {20797#true} call ULTIMATE.init(); {20797#true} is VALID [2022-04-15 06:04:28,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {20797#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20797#true} is VALID [2022-04-15 06:04:28,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {20797#true} assume true; {20797#true} is VALID [2022-04-15 06:04:28,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20797#true} {20797#true} #34#return; {20797#true} is VALID [2022-04-15 06:04:28,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {20797#true} call #t~ret4 := main(); {20797#true} is VALID [2022-04-15 06:04:28,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {20797#true} ~x~0 := 268435441; {20802#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:28,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {20802#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20803#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:28,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {20803#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20804#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:28,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {20804#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20805#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:28,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {20805#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20806#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:28,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {20806#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20807#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:28,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {20807#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20808#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:28,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {20808#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20809#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:28,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {20809#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20810#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:28,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {20810#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20811#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:28,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {20811#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20812#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:28,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {20812#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20813#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:28,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {20813#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20814#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:28,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {20814#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20815#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:28,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {20815#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20816#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:28,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {20816#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20817#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:28,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {20817#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20818#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:28,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {20818#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20819#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:28,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {20819#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20820#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:28,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {20820#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20821#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:28,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {20821#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20822#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:28,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {20822#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20823#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:28,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {20823#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20824#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:28,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {20824#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20825#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:28,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {20825#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20826#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:28,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {20826#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20827#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:28,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {20827#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20828#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:28,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {20828#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20829#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:28,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {20829#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20830#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:28,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {20830#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20831#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:28,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {20831#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20832#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:28,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {20832#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20833#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:28,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {20833#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20834#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:28,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {20834#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20835#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:28,533 INFO L290 TraceCheckUtils]: 39: Hoare triple {20835#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20836#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:28,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {20836#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20837#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:28,534 INFO L290 TraceCheckUtils]: 41: Hoare triple {20837#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20838#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:28,534 INFO L290 TraceCheckUtils]: 42: Hoare triple {20838#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20839#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:28,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {20839#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20840#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:28,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {20840#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20841#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:28,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {20841#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20842#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:04:28,536 INFO L290 TraceCheckUtils]: 46: Hoare triple {20842#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20843#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:04:28,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {20843#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {20990#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:04:28,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {20990#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {20798#false} is VALID [2022-04-15 06:04:28,537 INFO L272 TraceCheckUtils]: 49: Hoare triple {20798#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {20798#false} is VALID [2022-04-15 06:04:28,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {20798#false} ~cond := #in~cond; {20798#false} is VALID [2022-04-15 06:04:28,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {20798#false} assume 0 == ~cond; {20798#false} is VALID [2022-04-15 06:04:28,538 INFO L290 TraceCheckUtils]: 52: Hoare triple {20798#false} assume !false; {20798#false} is VALID [2022-04-15 06:04:28,538 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:04:28,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:32,289 INFO L290 TraceCheckUtils]: 52: Hoare triple {20798#false} assume !false; {20798#false} is VALID [2022-04-15 06:04:32,290 INFO L290 TraceCheckUtils]: 51: Hoare triple {21009#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20798#false} is VALID [2022-04-15 06:04:32,290 INFO L290 TraceCheckUtils]: 50: Hoare triple {21013#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21009#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:04:32,290 INFO L272 TraceCheckUtils]: 49: Hoare triple {21017#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21013#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:04:32,291 INFO L290 TraceCheckUtils]: 48: Hoare triple {21021#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {21017#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:04:32,292 INFO L290 TraceCheckUtils]: 47: Hoare triple {21025#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21021#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,293 INFO L290 TraceCheckUtils]: 46: Hoare triple {21029#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21025#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {21033#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21029#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {21037#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21033#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {21041#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21037#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {21045#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21041#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {21049#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21045#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {21053#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21049#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {21057#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21053#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {21061#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21057#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {21065#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21061#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {21069#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21065#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {21073#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21069#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {21077#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21073#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {21081#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21077#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {21085#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21081#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {21089#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21085#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {21093#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21089#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {21097#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21093#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {21101#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21097#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {21105#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21101#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {21109#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21105#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {21113#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21109#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {21117#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21113#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {21121#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21117#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {21125#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21121#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {21129#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21125#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {21133#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21129#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {21137#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21133#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {21141#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21137#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {21145#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21141#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {21149#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21145#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {21153#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21149#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {21157#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21153#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {21161#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21157#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {21165#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21161#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {21169#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21165#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {21173#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21169#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {21177#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21173#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {21181#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21177#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {21185#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21181#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {21189#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21185#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {20797#true} ~x~0 := 268435441; {21189#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:04:32,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {20797#true} call #t~ret4 := main(); {20797#true} is VALID [2022-04-15 06:04:32,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20797#true} {20797#true} #34#return; {20797#true} is VALID [2022-04-15 06:04:32,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {20797#true} assume true; {20797#true} is VALID [2022-04-15 06:04:32,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {20797#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20797#true} is VALID [2022-04-15 06:04:32,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {20797#true} call ULTIMATE.init(); {20797#true} is VALID [2022-04-15 06:04:32,350 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:04:32,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187737353] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:32,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:32,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 48] total 93 [2022-04-15 06:04:32,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:32,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848939976] [2022-04-15 06:04:32,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848939976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:32,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:32,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 06:04:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205115834] [2022-04-15 06:04:32,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:32,351 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:04:32,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:32,351 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:04:32,380 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:04:32,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 06:04:32,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:32,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 06:04:32,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6395, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 06:04:32,382 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:04:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:36,161 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 06:04:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 06:04:36,161 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:04:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:36,162 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:04:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-15 06:04:36,162 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:04:36,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-15 06:04:36,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-15 06:04:36,197 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:04:36,198 INFO L225 Difference]: With dead ends: 60 [2022-04-15 06:04:36,198 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 06:04:36,199 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4266, Invalid=14094, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 06:04:36,199 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:36,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:04:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 06:04:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 06:04:36,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:36,249 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:04:36,249 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:04:36,249 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:04:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:36,250 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 06:04:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 06:04:36,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:36,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:36,250 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:04:36,250 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:04:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:36,251 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 06:04:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 06:04:36,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:36,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:36,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:36,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:36,251 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:04:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-15 06:04:36,252 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2022-04-15 06:04:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:36,252 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-15 06:04:36,252 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:04:36,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-15 06:04:36,291 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:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 06:04:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 06:04:36,291 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:36,291 INFO L499 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:36,296 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:04:36,495 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:04:36,692 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:04:36,692 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:36,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2136038966, now seen corresponding path program 85 times [2022-04-15 06:04:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:36,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [431290706] [2022-04-15 06:04:36,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 06:04:36,814 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:04:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash 615116663, now seen corresponding path program 1 times [2022-04-15 06:04:36,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:36,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710656527] [2022-04-15 06:04:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:36,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:36,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_43.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:04:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:04:36,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402472847] [2022-04-15 06:04:36,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:36,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:36,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:36,832 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:04:36,833 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:04:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:36,854 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:04:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:36,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:04:36,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2136038966, now seen corresponding path program 86 times [2022-04-15 06:04:36,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:36,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559592052] [2022-04-15 06:04:36,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:36,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:37,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {21685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21636#true} is VALID [2022-04-15 06:04:37,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-15 06:04:37,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21636#true} {21636#true} #34#return; {21636#true} is VALID [2022-04-15 06:04:37,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {21636#true} call ULTIMATE.init(); {21685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:37,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {21685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21636#true} is VALID [2022-04-15 06:04:37,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-15 06:04:37,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21636#true} {21636#true} #34#return; {21636#true} is VALID [2022-04-15 06:04:37,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {21636#true} call #t~ret4 := main(); {21636#true} is VALID [2022-04-15 06:04:37,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {21636#true} ~x~0 := 268435441; {21641#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:37,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {21641#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21642#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:37,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {21642#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21643#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:37,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {21643#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21644#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:37,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {21644#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21645#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:37,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {21645#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21646#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:37,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {21646#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21647#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:37,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {21647#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21648#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:37,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {21648#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21649#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:37,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {21649#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21650#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:37,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {21650#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21651#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:37,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {21651#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21652#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:37,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {21652#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21653#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:37,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {21653#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21654#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:37,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {21654#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21655#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:37,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {21655#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21656#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:37,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {21656#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21657#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:37,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {21657#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21658#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:37,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {21658#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21659#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:37,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {21659#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21660#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:37,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {21660#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21661#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:37,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {21661#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21662#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:37,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {21662#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21663#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:37,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {21663#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21664#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:37,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {21664#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21665#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:37,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {21665#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21666#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:37,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {21666#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21667#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:37,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {21667#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21668#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:37,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {21668#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21669#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:37,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {21669#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21670#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:37,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {21670#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21671#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:37,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {21671#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21672#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:37,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {21672#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21673#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:37,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {21673#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21674#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:37,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {21674#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21675#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:37,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {21675#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21676#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:37,899 INFO L290 TraceCheckUtils]: 41: Hoare triple {21676#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21677#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:37,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {21677#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21678#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:37,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {21678#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21679#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:37,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {21679#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21680#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:37,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {21680#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21681#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:04:37,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {21681#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21682#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:04:37,902 INFO L290 TraceCheckUtils]: 47: Hoare triple {21682#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21683#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:04:37,902 INFO L290 TraceCheckUtils]: 48: Hoare triple {21683#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21684#(and (<= (div main_~x~0 4294967296) 0) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:04:37,903 INFO L290 TraceCheckUtils]: 49: Hoare triple {21684#(and (<= (div main_~x~0 4294967296) 0) (<= 268435355 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {21637#false} is VALID [2022-04-15 06:04:37,903 INFO L272 TraceCheckUtils]: 50: Hoare triple {21637#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21637#false} is VALID [2022-04-15 06:04:37,903 INFO L290 TraceCheckUtils]: 51: Hoare triple {21637#false} ~cond := #in~cond; {21637#false} is VALID [2022-04-15 06:04:37,903 INFO L290 TraceCheckUtils]: 52: Hoare triple {21637#false} assume 0 == ~cond; {21637#false} is VALID [2022-04-15 06:04:37,903 INFO L290 TraceCheckUtils]: 53: Hoare triple {21637#false} assume !false; {21637#false} is VALID [2022-04-15 06:04:37,903 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:04:37,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:37,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559592052] [2022-04-15 06:04:37,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559592052] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:37,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085336605] [2022-04-15 06:04:37,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:04:37,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:37,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:37,905 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:04:37,905 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:04:37,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:04:37,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:37,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-15 06:04:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:37,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:38,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {21636#true} call ULTIMATE.init(); {21636#true} is VALID [2022-04-15 06:04:38,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {21636#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21636#true} is VALID [2022-04-15 06:04:38,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-15 06:04:38,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21636#true} {21636#true} #34#return; {21636#true} is VALID [2022-04-15 06:04:38,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {21636#true} call #t~ret4 := main(); {21636#true} is VALID [2022-04-15 06:04:38,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {21636#true} ~x~0 := 268435441; {21641#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:38,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {21641#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21642#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:38,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {21642#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21643#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:38,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {21643#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21644#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:38,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {21644#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21645#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:38,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {21645#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21646#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:38,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {21646#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21647#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:38,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {21647#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21648#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:38,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {21648#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21649#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:38,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {21649#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21650#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:38,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {21650#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21651#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:38,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {21651#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21652#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:38,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {21652#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21653#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:38,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {21653#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21654#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:38,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {21654#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21655#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:38,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {21655#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21656#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:38,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {21656#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21657#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:38,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {21657#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21658#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:38,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {21658#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21659#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:38,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {21659#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21660#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:38,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {21660#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21661#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:38,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {21661#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21662#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:38,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {21662#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21663#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:38,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {21663#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21664#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:38,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {21664#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21665#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:38,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {21665#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21666#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:38,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {21666#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21667#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:38,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {21667#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21668#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:38,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {21668#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21669#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:38,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {21669#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21670#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:38,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {21670#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21671#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:38,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {21671#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21672#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:38,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {21672#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21673#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:38,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {21673#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21674#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:38,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {21674#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21675#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:38,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {21675#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21676#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:38,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {21676#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21677#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:38,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {21677#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21678#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:38,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {21678#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21679#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:38,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {21679#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21680#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:38,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {21680#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21681#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:04:38,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {21681#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21682#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:04:38,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {21682#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21683#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:04:38,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {21683#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21833#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:04:38,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {21833#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {21637#false} is VALID [2022-04-15 06:04:38,474 INFO L272 TraceCheckUtils]: 50: Hoare triple {21637#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21637#false} is VALID [2022-04-15 06:04:38,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {21637#false} ~cond := #in~cond; {21637#false} is VALID [2022-04-15 06:04:38,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {21637#false} assume 0 == ~cond; {21637#false} is VALID [2022-04-15 06:04:38,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {21637#false} assume !false; {21637#false} is VALID [2022-04-15 06:04:38,475 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:04:38,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:41,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {21637#false} assume !false; {21637#false} is VALID [2022-04-15 06:04:41,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {21637#false} assume 0 == ~cond; {21637#false} is VALID [2022-04-15 06:04:41,391 INFO L290 TraceCheckUtils]: 51: Hoare triple {21637#false} ~cond := #in~cond; {21637#false} is VALID [2022-04-15 06:04:41,391 INFO L272 TraceCheckUtils]: 50: Hoare triple {21637#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21637#false} is VALID [2022-04-15 06:04:41,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {21861#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {21637#false} is VALID [2022-04-15 06:04:41,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {21865#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21861#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:04:41,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {21869#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21865#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:04:41,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {21873#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21869#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {21877#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21873#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {21881#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21877#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {21885#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21881#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:04:41,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {21889#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21885#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:04:41,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {21893#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21889#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {21897#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21893#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:04:41,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {21901#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21897#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:04:41,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {21905#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21901#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {21909#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21905#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {21913#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21909#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {21917#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21913#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:04:41,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {21921#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21917#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:04:41,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {21925#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21921#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:04:41,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {21929#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21925#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:04:41,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {21933#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21929#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:04:41,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {21937#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21933#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {21941#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21937#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:04:41,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {21945#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21941#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:04:41,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {21949#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21945#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {21953#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21949#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:04:41,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {21957#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21953#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {21961#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21957#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:04:41,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {21965#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21961#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {21969#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21965#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:04:41,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {21973#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21969#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:04:41,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {21977#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21973#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {21981#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21977#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {21985#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21981#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:04:41,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {21989#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21985#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:04:41,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {21993#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21989#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:04:41,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {21997#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21993#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {22001#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {21997#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:04:41,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {22005#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22001#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:04:41,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {22009#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22005#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {22013#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22009#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:04:41,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {22017#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22013#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:04:41,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {22021#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22017#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {22025#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22021#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {22029#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22025#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} is VALID [2022-04-15 06:04:41,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {22033#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22029#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {21636#true} ~x~0 := 268435441; {22033#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:41,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {21636#true} call #t~ret4 := main(); {21636#true} is VALID [2022-04-15 06:04:41,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21636#true} {21636#true} #34#return; {21636#true} is VALID [2022-04-15 06:04:41,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-15 06:04:41,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {21636#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21636#true} is VALID [2022-04-15 06:04:41,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {21636#true} call ULTIMATE.init(); {21636#true} is VALID [2022-04-15 06:04:41,428 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:04:41,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085336605] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:41,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:41,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-15 06:04:41,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:41,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [431290706] [2022-04-15 06:04:41,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [431290706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:41,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:41,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 06:04:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983938273] [2022-04-15 06:04:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:41,429 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:41,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:41,429 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:04:41,456 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:04:41,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 06:04:41,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:41,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 06:04:41,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2205, Invalid=6167, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 06:04:41,457 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:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:45,080 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-15 06:04:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 06:04:45,081 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:45,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:45,081 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:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-15 06:04:45,081 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:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-15 06:04:45,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 61 transitions. [2022-04-15 06:04:45,117 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:45,118 INFO L225 Difference]: With dead ends: 61 [2022-04-15 06:04:45,118 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 06:04:45,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4403, Invalid=13957, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 06:04:45,120 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:45,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:04:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 06:04:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 06:04:45,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:45,173 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:45,173 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:45,173 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:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:45,174 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 06:04:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 06:04:45,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:45,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:45,174 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:45,174 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:45,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:45,175 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 06:04:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 06:04:45,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:45,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:45,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:45,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:45,175 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:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-15 06:04:45,175 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2022-04-15 06:04:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:45,176 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-15 06:04:45,176 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:45,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-15 06:04:45,222 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:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 06:04:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 06:04:45,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:45,223 INFO L499 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:45,227 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:45,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2022-04-15 06:04:45,623 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:45,624 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:45,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1829159772, now seen corresponding path program 87 times [2022-04-15 06:04:45,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:45,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2027180532] [2022-04-15 06:04:45,745 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:45,746 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:04:45,748 INFO L85 PathProgramCache]: Analyzing trace with hash 674222007, now seen corresponding path program 1 times [2022-04-15 06:04:45,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:45,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335639639] [2022-04-15 06:04:45,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:45,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:45,752 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_44.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:04:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:04:45,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204375497] [2022-04-15 06:04:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:45,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:45,756 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:45,757 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:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:45,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:04:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:45,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:04:45,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1829159772, now seen corresponding path program 88 times [2022-04-15 06:04:45,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:45,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961650806] [2022-04-15 06:04:45,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:46,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:46,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {22538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22488#true} is VALID [2022-04-15 06:04:46,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {22488#true} assume true; {22488#true} is VALID [2022-04-15 06:04:46,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22488#true} {22488#true} #34#return; {22488#true} is VALID [2022-04-15 06:04:46,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {22488#true} call ULTIMATE.init(); {22538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:46,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {22538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22488#true} is VALID [2022-04-15 06:04:46,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {22488#true} assume true; {22488#true} is VALID [2022-04-15 06:04:46,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22488#true} {22488#true} #34#return; {22488#true} is VALID [2022-04-15 06:04:46,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {22488#true} call #t~ret4 := main(); {22488#true} is VALID [2022-04-15 06:04:46,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {22488#true} ~x~0 := 268435441; {22493#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:46,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {22493#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22494#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:46,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {22494#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22495#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:46,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {22495#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22496#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:46,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {22496#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22497#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:46,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {22497#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22498#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:46,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {22498#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22499#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:46,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {22499#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22500#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:46,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {22500#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22501#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:46,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {22501#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22502#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:46,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {22502#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22503#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:46,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {22503#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22504#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:46,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {22504#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22505#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:46,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {22505#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22506#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:46,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {22506#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22507#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:46,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {22507#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22508#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:46,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {22508#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22509#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:46,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {22509#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22510#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:46,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {22510#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22511#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:46,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {22511#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22512#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:46,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {22512#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22513#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:46,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {22513#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22514#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:46,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {22514#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22515#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:46,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {22515#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22516#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:46,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {22516#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22517#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:46,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {22517#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22518#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:46,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {22518#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22519#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:46,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {22519#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22520#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:46,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {22520#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22521#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:46,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {22521#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22522#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:46,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {22522#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22523#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:46,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {22523#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22524#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:46,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {22524#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22525#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:46,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {22525#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22526#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:46,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {22526#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22527#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:46,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {22527#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22528#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:46,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {22528#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22529#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:46,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {22529#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22530#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:46,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {22530#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22531#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:46,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {22531#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22532#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:46,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {22532#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22533#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:04:46,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {22533#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22534#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:04:46,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {22534#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22535#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:04:46,822 INFO L290 TraceCheckUtils]: 48: Hoare triple {22535#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22536#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:04:46,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {22536#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22537#(and (<= (div main_~x~0 4294967296) 0) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:04:46,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {22537#(and (<= (div main_~x~0 4294967296) 0) (<= 268435353 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {22489#false} is VALID [2022-04-15 06:04:46,824 INFO L272 TraceCheckUtils]: 51: Hoare triple {22489#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22489#false} is VALID [2022-04-15 06:04:46,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {22489#false} ~cond := #in~cond; {22489#false} is VALID [2022-04-15 06:04:46,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {22489#false} assume 0 == ~cond; {22489#false} is VALID [2022-04-15 06:04:46,824 INFO L290 TraceCheckUtils]: 54: Hoare triple {22489#false} assume !false; {22489#false} is VALID [2022-04-15 06:04:46,824 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:46,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:46,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961650806] [2022-04-15 06:04:46,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961650806] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:46,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856487220] [2022-04-15 06:04:46,824 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:04:46,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:46,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:46,825 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:46,826 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:46,927 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:04:46,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:46,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 91 conjunts are in the unsatisfiable core [2022-04-15 06:04:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:46,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:47,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {22488#true} call ULTIMATE.init(); {22488#true} is VALID [2022-04-15 06:04:47,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {22488#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22488#true} is VALID [2022-04-15 06:04:47,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {22488#true} assume true; {22488#true} is VALID [2022-04-15 06:04:47,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22488#true} {22488#true} #34#return; {22488#true} is VALID [2022-04-15 06:04:47,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {22488#true} call #t~ret4 := main(); {22488#true} is VALID [2022-04-15 06:04:47,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {22488#true} ~x~0 := 268435441; {22493#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:47,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {22493#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22494#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:47,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {22494#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22495#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:47,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {22495#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22496#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:47,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {22496#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22497#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:47,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {22497#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22498#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:47,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {22498#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22499#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:47,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {22499#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22500#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:47,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {22500#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22501#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:47,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {22501#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22502#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:47,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {22502#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22503#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:47,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {22503#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22504#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:47,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {22504#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22505#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:47,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {22505#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22506#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:47,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {22506#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22507#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:47,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {22507#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22508#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:47,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {22508#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22509#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:47,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {22509#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22510#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:47,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {22510#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22511#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:47,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {22511#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22512#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:47,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {22512#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22513#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:47,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {22513#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22514#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:47,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {22514#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22515#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:47,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {22515#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22516#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:47,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {22516#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22517#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:47,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {22517#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22518#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:47,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {22518#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22519#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:47,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {22519#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22520#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:47,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {22520#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22521#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:47,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {22521#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22522#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:47,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {22522#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22523#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:47,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {22523#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22524#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:47,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {22524#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22525#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:47,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {22525#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22526#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:47,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {22526#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22527#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:47,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {22527#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22528#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:47,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {22528#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22529#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:47,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {22529#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22530#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:47,462 INFO L290 TraceCheckUtils]: 43: Hoare triple {22530#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22531#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:47,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {22531#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22532#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:47,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {22532#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22533#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:04:47,463 INFO L290 TraceCheckUtils]: 46: Hoare triple {22533#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22534#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:04:47,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {22534#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22535#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:04:47,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {22535#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22536#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:04:47,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {22536#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22689#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:04:47,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {22689#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {22489#false} is VALID [2022-04-15 06:04:47,465 INFO L272 TraceCheckUtils]: 51: Hoare triple {22489#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22489#false} is VALID [2022-04-15 06:04:47,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {22489#false} ~cond := #in~cond; {22489#false} is VALID [2022-04-15 06:04:47,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {22489#false} assume 0 == ~cond; {22489#false} is VALID [2022-04-15 06:04:47,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {22489#false} assume !false; {22489#false} is VALID [2022-04-15 06:04:47,466 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:47,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:50,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {22489#false} assume !false; {22489#false} is VALID [2022-04-15 06:04:50,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {22489#false} assume 0 == ~cond; {22489#false} is VALID [2022-04-15 06:04:50,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {22489#false} ~cond := #in~cond; {22489#false} is VALID [2022-04-15 06:04:50,465 INFO L272 TraceCheckUtils]: 51: Hoare triple {22489#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22489#false} is VALID [2022-04-15 06:04:50,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {22717#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {22489#false} is VALID [2022-04-15 06:04:50,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {22721#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22717#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:04:50,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {22725#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22721#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:04:50,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {22729#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22725#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {22733#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22729#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,470 INFO L290 TraceCheckUtils]: 45: Hoare triple {22737#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22733#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,470 INFO L290 TraceCheckUtils]: 44: Hoare triple {22741#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22737#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:04:50,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {22745#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22741#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:04:50,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {22749#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22745#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {22753#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22749#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:04:50,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {22757#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22753#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:04:50,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {22761#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22757#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {22765#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22761#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {22769#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22765#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {22773#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22769#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:04:50,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {22777#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22773#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:04:50,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {22781#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22777#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:04:50,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {22785#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22781#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:04:50,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {22789#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22785#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:04:50,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {22793#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22789#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {22797#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22793#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:04:50,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {22801#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22797#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:04:50,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {22805#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22801#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {22809#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22805#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:04:50,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {22813#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22809#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {22817#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22813#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:04:50,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {22821#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22817#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {22825#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22821#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:04:50,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {22829#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22825#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:04:50,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {22833#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22829#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {22837#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22833#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {22841#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22837#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:04:50,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {22845#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22841#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:04:50,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {22849#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22845#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:04:50,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {22853#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22849#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {22857#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22853#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:04:50,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {22861#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22857#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:04:50,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {22865#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22861#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {22869#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22865#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:04:50,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {22873#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22869#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:04:50,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {22877#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22873#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {22881#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22877#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {22885#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22881#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} is VALID [2022-04-15 06:04:50,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {22889#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22885#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {22893#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {22889#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} is VALID [2022-04-15 06:04:50,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {22488#true} ~x~0 := 268435441; {22893#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} is VALID [2022-04-15 06:04:50,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {22488#true} call #t~ret4 := main(); {22488#true} is VALID [2022-04-15 06:04:50,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22488#true} {22488#true} #34#return; {22488#true} is VALID [2022-04-15 06:04:50,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {22488#true} assume true; {22488#true} is VALID [2022-04-15 06:04:50,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {22488#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22488#true} is VALID [2022-04-15 06:04:50,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {22488#true} call ULTIMATE.init(); {22488#true} is VALID [2022-04-15 06:04:50,497 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:50,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856487220] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:50,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:50,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2022-04-15 06:04:50,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:50,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2027180532] [2022-04-15 06:04:50,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2027180532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:50,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:50,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 06:04:50,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264782331] [2022-04-15 06:04:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:50,498 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:50,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:50,498 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:50,525 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:50,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 06:04:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:50,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 06:04:50,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=6442, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 06:04:50,526 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:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:54,275 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 06:04:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 06:04:54,275 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:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:54,275 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:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-15 06:04:54,276 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:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-15 06:04:54,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 62 transitions. [2022-04-15 06:04:54,312 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:54,313 INFO L225 Difference]: With dead ends: 62 [2022-04-15 06:04:54,313 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 06:04:54,314 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4593, Invalid=14589, Unknown=0, NotChecked=0, Total=19182 [2022-04-15 06:04:54,314 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:54,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:04:54,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 06:04:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 06:04:54,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:54,369 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:54,369 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:54,369 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:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:54,370 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-15 06:04:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-15 06:04:54,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:54,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:54,370 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:54,370 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:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:54,371 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-15 06:04:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-15 06:04:54,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:54,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:54,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:54,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:54,371 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:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-15 06:04:54,372 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2022-04-15 06:04:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:54,372 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-15 06:04:54,372 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:54,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-15 06:04:54,418 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:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-15 06:04:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 06:04:54,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:54,419 INFO L499 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:54,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2022-04-15 06:04:54,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2022-04-15 06:04:54,819 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:54,820 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:54,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash 905839350, now seen corresponding path program 89 times [2022-04-15 06:04:54,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:54,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032232821] [2022-04-15 06:04:54,952 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:54,953 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:04:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash 733327351, now seen corresponding path program 1 times [2022-04-15 06:04:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:54,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468602642] [2022-04-15 06:04:54,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:54,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:54,959 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_45.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:04:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:04:54,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402020376] [2022-04-15 06:04:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:54,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:54,962 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:54,964 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:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:54,998 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:04:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:04:55,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:04:55,006 INFO L85 PathProgramCache]: Analyzing trace with hash 905839350, now seen corresponding path program 90 times [2022-04-15 06:04:55,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:55,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650071936] [2022-04-15 06:04:55,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:55,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:56,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:56,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {23407#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23356#true} is VALID [2022-04-15 06:04:56,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {23356#true} assume true; {23356#true} is VALID [2022-04-15 06:04:56,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23356#true} {23356#true} #34#return; {23356#true} is VALID [2022-04-15 06:04:56,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {23356#true} call ULTIMATE.init(); {23407#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:56,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {23407#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23356#true} is VALID [2022-04-15 06:04:56,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {23356#true} assume true; {23356#true} is VALID [2022-04-15 06:04:56,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23356#true} {23356#true} #34#return; {23356#true} is VALID [2022-04-15 06:04:56,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {23356#true} call #t~ret4 := main(); {23356#true} is VALID [2022-04-15 06:04:56,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {23356#true} ~x~0 := 268435441; {23361#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:04:56,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {23361#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23362#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:04:56,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {23362#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23363#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:04:56,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {23363#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23364#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:04:56,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {23364#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23365#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:04:56,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {23365#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23366#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:04:56,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {23366#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23367#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:04:56,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {23367#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23368#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:04:56,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {23368#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23369#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:04:56,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {23369#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23370#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:04:56,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {23370#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23371#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:04:56,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {23371#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23372#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:04:56,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {23372#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23373#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:04:56,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {23373#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23374#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:04:56,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {23374#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23375#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:04:56,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {23375#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23376#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:04:56,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {23376#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23377#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:04:56,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {23377#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23378#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:04:56,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {23378#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23379#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:04:56,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {23379#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23380#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:04:56,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {23380#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23381#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:04:56,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {23381#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23382#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:04:56,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {23382#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23383#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:04:56,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {23383#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23384#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:04:56,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {23384#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23385#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:04:56,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {23385#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23386#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:04:56,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {23386#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23387#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:04:56,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {23387#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23388#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:04:56,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {23388#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23389#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:04:56,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {23389#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23390#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:04:56,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {23390#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23391#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:04:56,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {23391#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23392#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:04:56,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {23392#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23393#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:04:56,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {23393#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23394#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:04:56,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {23394#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23395#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:04:56,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {23395#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23396#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:04:56,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {23396#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23397#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:04:56,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {23397#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23398#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:04:56,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {23398#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23399#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:04:56,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {23399#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23400#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:04:56,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {23400#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23401#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:04:56,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {23401#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23402#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:04:56,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {23402#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23403#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:04:56,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {23403#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23404#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:04:56,163 INFO L290 TraceCheckUtils]: 49: Hoare triple {23404#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23405#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:04:56,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {23405#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23406#(and (<= 268435351 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:04:56,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {23406#(and (<= 268435351 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {23357#false} is VALID [2022-04-15 06:04:56,164 INFO L272 TraceCheckUtils]: 52: Hoare triple {23357#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23357#false} is VALID [2022-04-15 06:04:56,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {23357#false} ~cond := #in~cond; {23357#false} is VALID [2022-04-15 06:04:56,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {23357#false} assume 0 == ~cond; {23357#false} is VALID [2022-04-15 06:04:56,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {23357#false} assume !false; {23357#false} is VALID [2022-04-15 06:04:56,164 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:56,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:56,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650071936] [2022-04-15 06:04:56,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650071936] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:56,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649184712] [2022-04-15 06:04:56,165 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:04:56,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:56,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:56,166 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:56,166 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:05:05,378 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2022-04-15 06:05:05,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:05,391 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 93 conjunts are in the unsatisfiable core [2022-04-15 06:05:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:05,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:06,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {23356#true} call ULTIMATE.init(); {23356#true} is VALID [2022-04-15 06:05:06,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {23356#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23356#true} is VALID [2022-04-15 06:05:06,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {23356#true} assume true; {23356#true} is VALID [2022-04-15 06:05:06,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23356#true} {23356#true} #34#return; {23356#true} is VALID [2022-04-15 06:05:06,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {23356#true} call #t~ret4 := main(); {23356#true} is VALID [2022-04-15 06:05:06,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {23356#true} ~x~0 := 268435441; {23361#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:05:06,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {23361#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23362#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:05:06,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {23362#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23363#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:05:06,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {23363#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23364#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:05:06,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {23364#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23365#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:05:06,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {23365#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23366#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:05:06,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {23366#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23367#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:05:06,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {23367#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23368#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:05:06,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {23368#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23369#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:05:06,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {23369#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23370#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:05:06,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {23370#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23371#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:05:06,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {23371#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23372#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:05:06,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {23372#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23373#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:05:06,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {23373#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23374#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:05:06,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {23374#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23375#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:05:06,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {23375#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23376#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:05:06,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {23376#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23377#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:05:06,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {23377#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23378#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:05:06,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {23378#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23379#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:05:06,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {23379#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23380#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:05:06,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {23380#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23381#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:05:06,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {23381#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23382#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:05:06,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {23382#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23383#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:05:06,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {23383#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23384#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:05:06,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {23384#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23385#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:05:06,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {23385#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23386#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:05:06,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {23386#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23387#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:05:06,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {23387#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23388#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:05:06,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {23388#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23389#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:05:06,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {23389#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23390#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:05:06,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {23390#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23391#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:05:06,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {23391#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23392#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:05:06,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {23392#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23393#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:05:06,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {23393#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23394#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:05:06,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {23394#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23395#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:05:06,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {23395#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23396#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:05:06,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {23396#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23397#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:05:06,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {23397#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23398#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:05:06,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {23398#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23399#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:05:06,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {23399#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23400#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:05:06,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {23400#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23401#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:05:06,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {23401#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23402#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:05:06,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {23402#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23403#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:05:06,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {23403#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23404#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:05:06,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {23404#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23405#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:05:06,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {23405#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23561#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:05:06,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {23561#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !(~x~0 % 4294967296 > 1); {23357#false} is VALID [2022-04-15 06:05:06,057 INFO L272 TraceCheckUtils]: 52: Hoare triple {23357#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23357#false} is VALID [2022-04-15 06:05:06,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {23357#false} ~cond := #in~cond; {23357#false} is VALID [2022-04-15 06:05:06,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {23357#false} assume 0 == ~cond; {23357#false} is VALID [2022-04-15 06:05:06,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {23357#false} assume !false; {23357#false} is VALID [2022-04-15 06:05:06,057 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:05:06,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:09,360 INFO L290 TraceCheckUtils]: 55: Hoare triple {23357#false} assume !false; {23357#false} is VALID [2022-04-15 06:05:09,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {23357#false} assume 0 == ~cond; {23357#false} is VALID [2022-04-15 06:05:09,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {23357#false} ~cond := #in~cond; {23357#false} is VALID [2022-04-15 06:05:09,361 INFO L272 TraceCheckUtils]: 52: Hoare triple {23357#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23357#false} is VALID [2022-04-15 06:05:09,361 INFO L290 TraceCheckUtils]: 51: Hoare triple {23589#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {23357#false} is VALID [2022-04-15 06:05:09,362 INFO L290 TraceCheckUtils]: 50: Hoare triple {23593#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23589#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:05:09,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {23597#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23593#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:05:09,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {23601#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23597#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {23605#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23601#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {23609#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23605#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {23613#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23609#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:05:09,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {23617#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23613#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:05:09,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {23621#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23617#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {23625#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23621#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:05:09,374 INFO L290 TraceCheckUtils]: 41: Hoare triple {23629#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23625#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:05:09,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {23633#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23629#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {23637#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23633#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {23641#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23637#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {23645#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23641#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:05:09,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {23649#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23645#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:05:09,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {23653#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23649#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:05:09,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {23657#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23653#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:05:09,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {23661#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23657#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:05:09,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {23665#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23661#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {23669#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23665#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:05:09,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {23673#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23669#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:05:09,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {23677#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23673#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {23681#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23677#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:05:09,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {23685#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23681#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {23689#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23685#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:05:09,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {23693#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23689#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {23697#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23693#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:05:09,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {23701#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23697#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:05:09,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {23705#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23701#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {23709#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23705#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {23713#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23709#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:05:09,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {23717#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23713#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:05:09,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {23721#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23717#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:05:09,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {23725#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23721#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {23729#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23725#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:05:09,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {23733#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23729#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:05:09,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {23737#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23733#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {23741#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23737#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:05:09,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {23745#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23741#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:05:09,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {23749#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23745#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {23753#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23749#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {23757#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23753#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} is VALID [2022-04-15 06:05:09,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {23761#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23757#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {23765#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23761#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {23769#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {23765#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} is VALID [2022-04-15 06:05:09,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {23356#true} ~x~0 := 268435441; {23769#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:09,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {23356#true} call #t~ret4 := main(); {23356#true} is VALID [2022-04-15 06:05:09,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23356#true} {23356#true} #34#return; {23356#true} is VALID [2022-04-15 06:05:09,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {23356#true} assume true; {23356#true} is VALID [2022-04-15 06:05:09,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {23356#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23356#true} is VALID [2022-04-15 06:05:09,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {23356#true} call ULTIMATE.init(); {23356#true} is VALID [2022-04-15 06:05:09,403 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:05:09,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649184712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:09,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:09,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-15 06:05:09,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:09,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2032232821] [2022-04-15 06:05:09,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2032232821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:09,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:09,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 06:05:09,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919957320] [2022-04-15 06:05:09,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:09,404 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:05:09,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:09,405 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:05:09,443 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:05:09,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 06:05:09,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:09,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 06:05:09,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2397, Invalid=6723, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 06:05:09,445 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:05:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:13,780 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-15 06:05:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 06:05:13,780 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:05:13,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:13,780 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:05:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-15 06:05:13,781 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:05:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-15 06:05:13,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 63 transitions. [2022-04-15 06:05:13,822 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:13,822 INFO L225 Difference]: With dead ends: 63 [2022-04-15 06:05:13,823 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 06:05:13,824 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4787, Invalid=15235, Unknown=0, NotChecked=0, Total=20022 [2022-04-15 06:05:13,824 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:13,824 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:05:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 06:05:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-15 06:05:13,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:13,893 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:05:13,893 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:05:13,893 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:05:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:13,893 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 06:05:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 06:05:13,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:13,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:13,894 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:05:13,894 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:05:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:13,894 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 06:05:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 06:05:13,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:13,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:13,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:13,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:13,895 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:05:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-15 06:05:13,895 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2022-04-15 06:05:13,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:13,896 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-15 06:05:13,896 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:05:13,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2022-04-15 06:05:13,939 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:05:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 06:05:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 06:05:13,940 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:13,940 INFO L499 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:13,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2022-04-15 06:05:14,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-04-15 06:05:14,340 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:05:14,341 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 91 times [2022-04-15 06:05:14,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:14,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [810955003] [2022-04-15 06:05:14,477 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:14,479 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:05:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash 792432695, now seen corresponding path program 1 times [2022-04-15 06:05:14,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:14,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131680586] [2022-04-15 06:05:14,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:14,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:14,485 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_46.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:05:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:05:14,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007041248] [2022-04-15 06:05:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:14,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:14,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:14,489 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:05:14,489 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:05:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:14,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:05:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:14,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:05:14,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 92 times [2022-04-15 06:05:14,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:14,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591779742] [2022-04-15 06:05:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:15,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {24292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24240#true} is VALID [2022-04-15 06:05:15,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {24240#true} assume true; {24240#true} is VALID [2022-04-15 06:05:15,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24240#true} {24240#true} #34#return; {24240#true} is VALID [2022-04-15 06:05:15,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {24240#true} call ULTIMATE.init(); {24292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:15,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {24292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24240#true} is VALID [2022-04-15 06:05:15,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {24240#true} assume true; {24240#true} is VALID [2022-04-15 06:05:15,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24240#true} {24240#true} #34#return; {24240#true} is VALID [2022-04-15 06:05:15,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {24240#true} call #t~ret4 := main(); {24240#true} is VALID [2022-04-15 06:05:15,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {24240#true} ~x~0 := 268435441; {24245#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:05:15,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {24245#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24246#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:05:15,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {24246#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24247#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:05:15,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {24247#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24248#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:05:15,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {24248#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24249#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:05:15,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {24249#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24250#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:05:15,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {24250#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24251#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:05:15,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {24251#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24252#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:05:15,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {24252#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24253#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:05:15,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {24253#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24254#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:05:15,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {24254#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24255#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:05:15,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {24255#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24256#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:05:15,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {24256#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24257#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:05:15,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {24257#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24258#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:05:15,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {24258#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24259#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:05:15,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {24259#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24260#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:05:15,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {24260#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24261#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:05:15,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {24261#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24262#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:05:15,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {24262#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24263#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:05:15,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {24263#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24264#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:05:15,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {24264#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24265#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:05:15,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {24265#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24266#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:05:15,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {24266#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24267#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:05:15,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {24267#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24268#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:05:15,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {24268#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24269#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:05:15,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {24269#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24270#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:05:15,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {24270#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24271#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:05:15,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {24271#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24272#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:05:15,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {24272#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24273#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:05:15,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {24273#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24274#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:05:15,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {24274#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24275#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:05:15,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {24275#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24276#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:05:15,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {24276#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24277#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:05:15,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {24277#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24278#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:05:15,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {24278#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24279#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:05:15,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {24279#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24280#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:05:15,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {24280#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24281#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:05:15,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {24281#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24282#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:05:15,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {24282#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24283#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:05:15,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {24283#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24284#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:05:15,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {24284#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24285#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:05:15,743 INFO L290 TraceCheckUtils]: 46: Hoare triple {24285#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24286#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:05:15,744 INFO L290 TraceCheckUtils]: 47: Hoare triple {24286#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24287#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:05:15,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {24287#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24288#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:05:15,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {24288#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24289#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:05:15,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {24289#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24290#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:05:15,746 INFO L290 TraceCheckUtils]: 51: Hoare triple {24290#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24291#(and (<= (div main_~x~0 4294967296) 0) (<= 268435349 main_~x~0))} is VALID [2022-04-15 06:05:15,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {24291#(and (<= (div main_~x~0 4294967296) 0) (<= 268435349 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {24241#false} is VALID [2022-04-15 06:05:15,746 INFO L272 TraceCheckUtils]: 53: Hoare triple {24241#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24241#false} is VALID [2022-04-15 06:05:15,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {24241#false} ~cond := #in~cond; {24241#false} is VALID [2022-04-15 06:05:15,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {24241#false} assume 0 == ~cond; {24241#false} is VALID [2022-04-15 06:05:15,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {24241#false} assume !false; {24241#false} is VALID [2022-04-15 06:05:15,747 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:05:15,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:15,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591779742] [2022-04-15 06:05:15,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591779742] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:15,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376421541] [2022-04-15 06:05:15,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:05:15,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:15,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:15,748 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:05:15,755 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:05:15,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:05:15,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:15,899 WARN L261 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-15 06:05:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:15,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:16,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {24240#true} call ULTIMATE.init(); {24240#true} is VALID [2022-04-15 06:05:16,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {24240#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24240#true} is VALID [2022-04-15 06:05:16,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {24240#true} assume true; {24240#true} is VALID [2022-04-15 06:05:16,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24240#true} {24240#true} #34#return; {24240#true} is VALID [2022-04-15 06:05:16,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {24240#true} call #t~ret4 := main(); {24240#true} is VALID [2022-04-15 06:05:16,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {24240#true} ~x~0 := 268435441; {24245#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:05:16,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {24245#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24246#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:05:16,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {24246#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24247#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:05:16,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {24247#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24248#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:05:16,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {24248#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24249#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:05:16,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {24249#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24250#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:05:16,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {24250#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24251#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:05:16,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {24251#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24252#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:05:16,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {24252#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24253#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:05:16,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {24253#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24254#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:05:16,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {24254#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24255#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:05:16,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {24255#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24256#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:05:16,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {24256#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24257#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:05:16,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {24257#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24258#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:05:16,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {24258#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24259#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:05:16,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {24259#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24260#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:05:16,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {24260#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24261#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:05:16,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {24261#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24262#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:05:16,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {24262#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24263#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:05:16,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {24263#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24264#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:05:16,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {24264#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24265#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:05:16,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {24265#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24266#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:05:16,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {24266#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24267#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:05:16,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {24267#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24268#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:05:16,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {24268#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24269#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:05:16,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {24269#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24270#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:05:16,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {24270#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24271#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:05:16,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {24271#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24272#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:05:16,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {24272#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24273#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:05:16,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {24273#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24274#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:05:16,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {24274#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24275#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:05:16,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {24275#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24276#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:05:16,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {24276#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24277#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:05:16,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {24277#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24278#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:05:16,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {24278#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24279#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:05:16,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {24279#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24280#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:05:16,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {24280#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24281#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:05:16,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {24281#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24282#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:05:16,435 INFO L290 TraceCheckUtils]: 43: Hoare triple {24282#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24283#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:05:16,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {24283#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24284#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:05:16,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {24284#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24285#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:05:16,436 INFO L290 TraceCheckUtils]: 46: Hoare triple {24285#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24286#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:05:16,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {24286#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24287#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:05:16,437 INFO L290 TraceCheckUtils]: 48: Hoare triple {24287#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24288#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:05:16,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {24288#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24289#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:05:16,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {24289#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24290#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:05:16,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {24290#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24449#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:05:16,439 INFO L290 TraceCheckUtils]: 52: Hoare triple {24449#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !(~x~0 % 4294967296 > 1); {24241#false} is VALID [2022-04-15 06:05:16,439 INFO L272 TraceCheckUtils]: 53: Hoare triple {24241#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24241#false} is VALID [2022-04-15 06:05:16,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {24241#false} ~cond := #in~cond; {24241#false} is VALID [2022-04-15 06:05:16,439 INFO L290 TraceCheckUtils]: 55: Hoare triple {24241#false} assume 0 == ~cond; {24241#false} is VALID [2022-04-15 06:05:16,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {24241#false} assume !false; {24241#false} is VALID [2022-04-15 06:05:16,439 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:05:16,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:19,737 INFO L290 TraceCheckUtils]: 56: Hoare triple {24241#false} assume !false; {24241#false} is VALID [2022-04-15 06:05:19,737 INFO L290 TraceCheckUtils]: 55: Hoare triple {24241#false} assume 0 == ~cond; {24241#false} is VALID [2022-04-15 06:05:19,737 INFO L290 TraceCheckUtils]: 54: Hoare triple {24241#false} ~cond := #in~cond; {24241#false} is VALID [2022-04-15 06:05:19,738 INFO L272 TraceCheckUtils]: 53: Hoare triple {24241#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24241#false} is VALID [2022-04-15 06:05:19,738 INFO L290 TraceCheckUtils]: 52: Hoare triple {24477#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {24241#false} is VALID [2022-04-15 06:05:19,738 INFO L290 TraceCheckUtils]: 51: Hoare triple {24481#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24477#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:05:19,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {24485#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24481#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:05:19,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {24489#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24485#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {24493#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24489#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {24497#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24493#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,741 INFO L290 TraceCheckUtils]: 46: Hoare triple {24501#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24497#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:05:19,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {24505#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24501#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:05:19,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {24509#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24505#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {24513#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24509#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:05:19,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {24517#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24513#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:05:19,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {24521#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24517#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {24525#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24521#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {24529#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24525#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {24533#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24529#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:05:19,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {24537#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24533#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:05:19,748 INFO L290 TraceCheckUtils]: 36: Hoare triple {24541#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24537#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:05:19,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {24545#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24541#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:05:19,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {24549#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24545#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:05:19,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {24553#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24549#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {24557#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24553#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:05:19,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {24561#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24557#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:05:19,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {24565#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24561#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {24569#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24565#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:05:19,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {24573#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24569#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {24577#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24573#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:05:19,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {24581#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24577#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {24585#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24581#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:05:19,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {24589#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24585#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:05:19,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {24593#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24589#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {24597#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24593#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {24601#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24597#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:05:19,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {24605#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24601#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:05:19,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {24609#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24605#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:05:19,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {24613#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24609#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {24617#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24613#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:05:19,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {24621#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24617#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:05:19,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {24625#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24621#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {24629#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24625#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:05:19,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {24633#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24629#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:05:19,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {24637#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24633#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {24641#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24637#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {24645#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24641#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} is VALID [2022-04-15 06:05:19,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {24649#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24645#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {24653#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24649#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {24657#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24653#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} is VALID [2022-04-15 06:05:19,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {24661#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {24657#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:19,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {24240#true} ~x~0 := 268435441; {24661#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} is VALID [2022-04-15 06:05:19,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {24240#true} call #t~ret4 := main(); {24240#true} is VALID [2022-04-15 06:05:19,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24240#true} {24240#true} #34#return; {24240#true} is VALID [2022-04-15 06:05:19,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {24240#true} assume true; {24240#true} is VALID [2022-04-15 06:05:19,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {24240#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24240#true} is VALID [2022-04-15 06:05:19,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {24240#true} call ULTIMATE.init(); {24240#true} is VALID [2022-04-15 06:05:19,771 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:05:19,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376421541] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:19,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:19,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-15 06:05:19,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:19,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [810955003] [2022-04-15 06:05:19,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [810955003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:19,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:19,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 06:05:19,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411364788] [2022-04-15 06:05:19,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:19,772 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:05:19,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:19,773 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:05:19,810 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:05:19,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 06:05:19,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:19,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 06:05:19,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 06:05:19,811 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:05:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:24,120 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 06:05:24,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 06:05:24,120 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:05:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:24,121 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:05:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-15 06:05:24,122 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:05:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-15 06:05:24,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-15 06:05:24,162 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:05:24,163 INFO L225 Difference]: With dead ends: 64 [2022-04-15 06:05:24,163 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 06:05:24,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4985, Invalid=15895, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 06:05:24,165 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:24,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:05:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 06:05:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 06:05:24,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:24,225 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:05:24,225 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:05:24,225 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:05:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:24,226 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 06:05:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 06:05:24,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:24,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:24,226 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:05:24,226 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:05:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:24,226 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 06:05:24,227 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 06:05:24,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:24,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:24,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:24,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:24,227 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:05:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-15 06:05:24,227 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2022-04-15 06:05:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:24,228 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-15 06:05:24,228 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:05:24,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-15 06:05:24,276 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:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 06:05:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 06:05:24,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:24,277 INFO L499 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:24,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-04-15 06:05:24,488 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:05:24,684 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:05:24,684 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash -199985226, now seen corresponding path program 93 times [2022-04-15 06:05:24,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:24,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1092498793] [2022-04-15 06:05:24,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 06:05:24,815 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:05:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash 851538039, now seen corresponding path program 1 times [2022-04-15 06:05:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:24,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672267522] [2022-04-15 06:05:24,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:24,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:24,821 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_47.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:05:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:05:24,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50599915] [2022-04-15 06:05:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:24,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:24,824 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:05:24,825 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:05:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:24,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:05:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:24,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:05:24,882 INFO L85 PathProgramCache]: Analyzing trace with hash -199985226, now seen corresponding path program 94 times [2022-04-15 06:05:24,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:24,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064729210] [2022-04-15 06:05:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:26,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:26,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {25193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25140#true} is VALID [2022-04-15 06:05:26,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {25140#true} assume true; {25140#true} is VALID [2022-04-15 06:05:26,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25140#true} {25140#true} #34#return; {25140#true} is VALID [2022-04-15 06:05:26,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {25140#true} call ULTIMATE.init(); {25193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:26,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {25193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25140#true} is VALID [2022-04-15 06:05:26,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {25140#true} assume true; {25140#true} is VALID [2022-04-15 06:05:26,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25140#true} {25140#true} #34#return; {25140#true} is VALID [2022-04-15 06:05:26,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {25140#true} call #t~ret4 := main(); {25140#true} is VALID [2022-04-15 06:05:26,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {25140#true} ~x~0 := 268435441; {25145#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:05:26,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {25145#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25146#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:05:26,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {25146#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25147#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:05:26,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {25147#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25148#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:05:26,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {25148#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25149#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:05:26,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {25149#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25150#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:05:26,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {25150#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25151#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:05:26,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {25151#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25152#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:05:26,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {25152#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25153#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:05:26,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {25153#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25154#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:05:26,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {25154#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25155#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:05:26,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {25155#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25156#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:05:26,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {25156#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25157#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:05:26,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {25157#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25158#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:05:26,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {25158#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25159#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:05:26,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {25159#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25160#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:05:26,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {25160#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25161#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:05:26,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {25161#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25162#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:05:26,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {25162#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25163#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:05:26,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {25163#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25164#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:05:26,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {25164#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25165#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:05:26,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {25165#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25166#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:05:26,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {25166#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25167#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:05:26,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {25167#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25168#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:05:26,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {25168#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25169#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:05:26,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {25169#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25170#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:05:26,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {25170#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25171#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:05:26,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {25171#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25172#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:05:26,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {25172#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25173#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:05:26,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {25173#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25174#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:05:26,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {25174#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25175#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:05:26,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {25175#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25176#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:05:26,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {25176#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25177#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:05:26,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {25177#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25178#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:05:26,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {25178#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25179#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:05:26,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {25179#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25180#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:05:26,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {25180#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25181#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:05:26,131 INFO L290 TraceCheckUtils]: 42: Hoare triple {25181#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25182#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:05:26,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {25182#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25183#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:05:26,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {25183#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25184#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:05:26,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {25184#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25185#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:05:26,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {25185#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25186#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:05:26,134 INFO L290 TraceCheckUtils]: 47: Hoare triple {25186#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25187#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:05:26,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {25187#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25188#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:05:26,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {25188#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25189#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:05:26,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {25189#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25190#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:05:26,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {25190#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25191#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:05:26,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {25191#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25192#(and (<= (div main_~x~0 4294967296) 0) (<= 268435347 main_~x~0))} is VALID [2022-04-15 06:05:26,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {25192#(and (<= (div main_~x~0 4294967296) 0) (<= 268435347 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {25141#false} is VALID [2022-04-15 06:05:26,137 INFO L272 TraceCheckUtils]: 54: Hoare triple {25141#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {25141#false} is VALID [2022-04-15 06:05:26,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {25141#false} ~cond := #in~cond; {25141#false} is VALID [2022-04-15 06:05:26,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {25141#false} assume 0 == ~cond; {25141#false} is VALID [2022-04-15 06:05:26,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {25141#false} assume !false; {25141#false} is VALID [2022-04-15 06:05:26,137 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:05:26,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:26,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064729210] [2022-04-15 06:05:26,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064729210] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:26,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343314720] [2022-04-15 06:05:26,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:05:26,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:26,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:26,139 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:05:26,139 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:05:26,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:05:26,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:26,311 WARN L261 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-15 06:05:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:26,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:26,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {25140#true} call ULTIMATE.init(); {25140#true} is VALID [2022-04-15 06:05:26,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {25140#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25140#true} is VALID [2022-04-15 06:05:26,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {25140#true} assume true; {25140#true} is VALID [2022-04-15 06:05:26,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25140#true} {25140#true} #34#return; {25140#true} is VALID [2022-04-15 06:05:26,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {25140#true} call #t~ret4 := main(); {25140#true} is VALID [2022-04-15 06:05:26,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {25140#true} ~x~0 := 268435441; {25145#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:05:26,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {25145#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25146#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:05:26,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {25146#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25147#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:05:26,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {25147#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25148#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:05:26,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {25148#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25149#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:05:26,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {25149#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25150#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:05:26,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {25150#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25151#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:05:26,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {25151#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25152#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:05:26,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {25152#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25153#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:05:26,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {25153#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25154#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:05:26,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {25154#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25155#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:05:26,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {25155#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25156#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:05:26,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {25156#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25157#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:05:26,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {25157#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25158#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:05:26,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {25158#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25159#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:05:26,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {25159#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25160#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:05:26,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {25160#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25161#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:05:26,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {25161#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25162#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:05:26,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {25162#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25163#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:05:26,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {25163#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25164#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:05:26,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {25164#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25165#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:05:26,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {25165#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25166#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:05:26,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {25166#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25167#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:05:26,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {25167#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25168#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:05:26,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {25168#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25169#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:05:26,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {25169#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25170#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:05:26,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {25170#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25171#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:05:26,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {25171#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25172#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:05:26,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {25172#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25173#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:05:26,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {25173#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25174#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:05:26,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {25174#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25175#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:05:26,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {25175#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25176#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:05:26,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {25176#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25177#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:05:26,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {25177#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25178#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:05:26,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {25178#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25179#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:05:26,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {25179#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25180#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:05:26,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {25180#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25181#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:05:26,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {25181#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25182#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:05:26,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {25182#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25183#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:05:26,906 INFO L290 TraceCheckUtils]: 44: Hoare triple {25183#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25184#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:05:26,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {25184#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25185#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:05:26,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {25185#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25186#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:05:26,907 INFO L290 TraceCheckUtils]: 47: Hoare triple {25186#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25187#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:05:26,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {25187#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25188#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:05:26,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {25188#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25189#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:05:26,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {25189#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25190#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:05:26,909 INFO L290 TraceCheckUtils]: 51: Hoare triple {25190#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25191#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:05:26,909 INFO L290 TraceCheckUtils]: 52: Hoare triple {25191#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25353#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:05:26,910 INFO L290 TraceCheckUtils]: 53: Hoare triple {25353#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !(~x~0 % 4294967296 > 1); {25141#false} is VALID [2022-04-15 06:05:26,910 INFO L272 TraceCheckUtils]: 54: Hoare triple {25141#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {25141#false} is VALID [2022-04-15 06:05:26,910 INFO L290 TraceCheckUtils]: 55: Hoare triple {25141#false} ~cond := #in~cond; {25141#false} is VALID [2022-04-15 06:05:26,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {25141#false} assume 0 == ~cond; {25141#false} is VALID [2022-04-15 06:05:26,910 INFO L290 TraceCheckUtils]: 57: Hoare triple {25141#false} assume !false; {25141#false} is VALID [2022-04-15 06:05:26,911 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:05:26,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:30,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {25141#false} assume !false; {25141#false} is VALID [2022-04-15 06:05:30,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {25141#false} assume 0 == ~cond; {25141#false} is VALID [2022-04-15 06:05:30,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {25141#false} ~cond := #in~cond; {25141#false} is VALID [2022-04-15 06:05:30,420 INFO L272 TraceCheckUtils]: 54: Hoare triple {25141#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {25141#false} is VALID [2022-04-15 06:05:30,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {25381#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {25141#false} is VALID [2022-04-15 06:05:30,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {25385#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25381#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:05:30,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {25389#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25385#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:05:30,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {25393#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25389#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {25397#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25393#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,430 INFO L290 TraceCheckUtils]: 48: Hoare triple {25401#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25397#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {25405#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25401#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:05:30,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {25409#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25405#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:05:30,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {25413#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25409#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {25417#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25413#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:05:30,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {25421#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25417#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:05:30,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {25425#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25421#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {25429#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25425#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {25433#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25429#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {25437#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25433#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:05:30,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {25441#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25437#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:05:30,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {25445#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25441#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:05:30,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {25449#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25445#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:05:30,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {25453#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25449#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:05:30,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {25457#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25453#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {25461#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25457#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:05:30,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {25465#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25461#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:05:30,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {25469#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25465#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {25473#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25469#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:05:30,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {25477#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25473#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {25481#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25477#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:05:30,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {25485#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25481#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {25489#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25485#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:05:30,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {25493#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25489#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:05:30,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {25497#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25493#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {25501#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25497#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {25505#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25501#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:05:30,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {25509#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25505#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:05:30,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {25513#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25509#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:05:30,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {25517#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25513#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {25521#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25517#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:05:30,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {25525#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25521#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:05:30,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {25529#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25525#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {25533#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25529#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:05:30,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {25537#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25533#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:05:30,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {25541#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25537#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {25545#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25541#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {25549#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25545#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} is VALID [2022-04-15 06:05:30,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {25553#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25549#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {25557#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25553#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {25561#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25557#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} is VALID [2022-04-15 06:05:30,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {25565#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25561#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {25569#(< 1 (mod (+ 4294967202 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {25565#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} is VALID [2022-04-15 06:05:30,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {25140#true} ~x~0 := 268435441; {25569#(< 1 (mod (+ 4294967202 main_~x~0) 4294967296))} is VALID [2022-04-15 06:05:30,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {25140#true} call #t~ret4 := main(); {25140#true} is VALID [2022-04-15 06:05:30,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25140#true} {25140#true} #34#return; {25140#true} is VALID [2022-04-15 06:05:30,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {25140#true} assume true; {25140#true} is VALID [2022-04-15 06:05:30,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {25140#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25140#true} is VALID [2022-04-15 06:05:30,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {25140#true} call ULTIMATE.init(); {25140#true} is VALID [2022-04-15 06:05:30,458 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:05:30,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343314720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:30,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:30,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 100 [2022-04-15 06:05:30,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:30,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1092498793] [2022-04-15 06:05:30,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1092498793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:30,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:30,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 06:05:30,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414938300] [2022-04-15 06:05:30,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:30,460 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:30,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:30,460 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:05:30,488 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:05:30,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 06:05:30,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:30,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 06:05:30,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2597, Invalid=7303, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 06:05:30,489 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:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:34,721 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-15 06:05:34,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 06:05:34,721 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:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:34,721 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:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-15 06:05:34,722 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:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-15 06:05:34,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 65 transitions. [2022-04-15 06:05:34,806 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:34,807 INFO L225 Difference]: With dead ends: 65 [2022-04-15 06:05:34,807 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 06:05:34,808 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5187, Invalid=16569, Unknown=0, NotChecked=0, Total=21756 [2022-04-15 06:05:34,809 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:34,809 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:05:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 06:05:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 06:05:34,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:34,864 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:34,864 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:34,864 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:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:34,865 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 06:05:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 06:05:34,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:34,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:34,865 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:34,865 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:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:34,866 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 06:05:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 06:05:34,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:34,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:34,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:34,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:34,866 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:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2022-04-15 06:05:34,867 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2022-04-15 06:05:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:34,867 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2022-04-15 06:05:34,867 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:34,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 60 transitions. [2022-04-15 06:05:34,918 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:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 06:05:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 06:05:34,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:34,919 INFO L499 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:34,938 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:35,125 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:35,319 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:35,320 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:35,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:35,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1868113444, now seen corresponding path program 95 times [2022-04-15 06:05:35,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:35,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1594603833] [2022-04-15 06:05:35,452 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:35,454 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:05:35,456 INFO L85 PathProgramCache]: Analyzing trace with hash 910643383, now seen corresponding path program 1 times [2022-04-15 06:05:35,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:35,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820994118] [2022-04-15 06:05:35,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:35,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:35,461 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_48.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:05:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:05:35,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799203873] [2022-04-15 06:05:35,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:35,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:35,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:35,466 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:35,467 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:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:35,504 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:05:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:35,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:05:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1868113444, now seen corresponding path program 96 times [2022-04-15 06:05:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:35,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206841807] [2022-04-15 06:05:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:36,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:36,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {26110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26056#true} is VALID [2022-04-15 06:05:36,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {26056#true} assume true; {26056#true} is VALID [2022-04-15 06:05:36,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26056#true} {26056#true} #34#return; {26056#true} is VALID [2022-04-15 06:05:36,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {26056#true} call ULTIMATE.init(); {26110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:36,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {26110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26056#true} is VALID [2022-04-15 06:05:36,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {26056#true} assume true; {26056#true} is VALID [2022-04-15 06:05:36,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26056#true} {26056#true} #34#return; {26056#true} is VALID [2022-04-15 06:05:36,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {26056#true} call #t~ret4 := main(); {26056#true} is VALID [2022-04-15 06:05:36,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {26056#true} ~x~0 := 268435441; {26061#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:05:36,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {26061#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26062#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:05:36,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {26062#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26063#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:05:36,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {26063#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26064#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:05:36,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {26064#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26065#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:05:36,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {26065#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26066#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:05:36,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {26066#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26067#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:05:36,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {26067#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26068#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:05:36,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {26068#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26069#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:05:36,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {26069#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26070#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:05:36,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {26070#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26071#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:05:36,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {26071#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26072#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:05:36,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {26072#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26073#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:05:36,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {26073#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26074#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:05:36,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {26074#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26075#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:05:36,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {26075#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26076#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:05:36,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {26076#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26077#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:05:36,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {26077#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26078#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:05:36,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {26078#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26079#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:05:36,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {26079#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26080#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:05:36,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {26080#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26081#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:05:36,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {26081#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26082#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:05:36,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {26082#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26083#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:05:36,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {26083#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26084#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:05:36,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {26084#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26085#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:05:36,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {26085#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26086#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:05:36,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {26086#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26087#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:05:36,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {26087#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26088#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:05:36,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {26088#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26089#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:05:36,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {26089#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26090#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:05:36,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {26090#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26091#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:05:36,704 INFO L290 TraceCheckUtils]: 36: Hoare triple {26091#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26092#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:05:36,704 INFO L290 TraceCheckUtils]: 37: Hoare triple {26092#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26093#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:05:36,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {26093#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26094#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:05:36,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {26094#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26095#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:05:36,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {26095#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26096#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:05:36,706 INFO L290 TraceCheckUtils]: 41: Hoare triple {26096#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26097#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:05:36,706 INFO L290 TraceCheckUtils]: 42: Hoare triple {26097#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26098#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:05:36,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {26098#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26099#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:05:36,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {26099#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26100#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:05:36,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {26100#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26101#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:05:36,708 INFO L290 TraceCheckUtils]: 46: Hoare triple {26101#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26102#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:05:36,709 INFO L290 TraceCheckUtils]: 47: Hoare triple {26102#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26103#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:05:36,709 INFO L290 TraceCheckUtils]: 48: Hoare triple {26103#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26104#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:05:36,710 INFO L290 TraceCheckUtils]: 49: Hoare triple {26104#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26105#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:05:36,710 INFO L290 TraceCheckUtils]: 50: Hoare triple {26105#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26106#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:05:36,711 INFO L290 TraceCheckUtils]: 51: Hoare triple {26106#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26107#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:05:36,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {26107#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26108#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:05:36,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {26108#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26109#(and (<= (div main_~x~0 4294967296) 0) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:05:36,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {26109#(and (<= (div main_~x~0 4294967296) 0) (<= 268435345 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {26057#false} is VALID [2022-04-15 06:05:36,712 INFO L272 TraceCheckUtils]: 55: Hoare triple {26057#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {26057#false} is VALID [2022-04-15 06:05:36,713 INFO L290 TraceCheckUtils]: 56: Hoare triple {26057#false} ~cond := #in~cond; {26057#false} is VALID [2022-04-15 06:05:36,713 INFO L290 TraceCheckUtils]: 57: Hoare triple {26057#false} assume 0 == ~cond; {26057#false} is VALID [2022-04-15 06:05:36,713 INFO L290 TraceCheckUtils]: 58: Hoare triple {26057#false} assume !false; {26057#false} is VALID [2022-04-15 06:05:36,713 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:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:36,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206841807] [2022-04-15 06:05:36,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206841807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:36,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785901146] [2022-04-15 06:05:36,713 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:05:36,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:36,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:36,715 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:36,715 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:43,730 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-15 06:05:43,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:43,736 WARN L261 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 102 conjunts are in the unsatisfiable core [2022-04-15 06:05:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:43,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:44,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {26056#true} call ULTIMATE.init(); {26056#true} is VALID [2022-04-15 06:05:44,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {26056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26056#true} is VALID [2022-04-15 06:05:44,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {26056#true} assume true; {26056#true} is VALID [2022-04-15 06:05:44,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26056#true} {26056#true} #34#return; {26056#true} is VALID [2022-04-15 06:05:44,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {26056#true} call #t~ret4 := main(); {26056#true} is VALID [2022-04-15 06:05:44,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {26056#true} ~x~0 := 268435441; {26061#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:05:44,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {26061#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26062#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:05:44,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {26062#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26063#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:05:44,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {26063#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26064#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:05:44,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {26064#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26065#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:05:44,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {26065#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26066#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:05:44,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {26066#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26067#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:05:44,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {26067#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26068#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:05:44,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {26068#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26069#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:05:44,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {26069#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26070#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:05:44,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {26070#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26071#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:05:44,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {26071#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26072#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:05:44,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {26072#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26073#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:05:44,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {26073#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26074#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:05:44,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {26074#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26075#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:05:44,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {26075#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26076#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:05:44,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {26076#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26077#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:05:44,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {26077#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26078#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:05:44,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {26078#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26079#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:05:44,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {26079#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26080#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:05:44,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {26080#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26081#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:05:44,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {26081#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26082#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:05:44,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {26082#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26083#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:05:44,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {26083#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26084#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:05:44,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {26084#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26085#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:05:44,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {26085#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26086#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:05:44,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {26086#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26087#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:05:44,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {26087#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26088#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:05:44,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {26088#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26089#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:05:44,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {26089#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26090#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:05:44,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {26090#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26091#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:05:44,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {26091#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26092#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:05:44,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {26092#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26093#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:05:44,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {26093#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26094#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:05:44,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {26094#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26095#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:05:44,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {26095#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26096#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:05:44,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {26096#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26097#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:05:44,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {26097#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26098#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:05:44,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {26098#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26099#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:05:44,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {26099#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26100#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:05:44,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {26100#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26101#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:05:44,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {26101#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26102#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:05:44,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {26102#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26103#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:05:44,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {26103#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26104#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:05:44,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {26104#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26105#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:05:44,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {26105#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26106#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:05:44,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {26106#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26107#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:05:44,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {26107#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26108#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:05:44,232 INFO L290 TraceCheckUtils]: 53: Hoare triple {26108#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26273#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:05:44,232 INFO L290 TraceCheckUtils]: 54: Hoare triple {26273#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {26057#false} is VALID [2022-04-15 06:05:44,232 INFO L272 TraceCheckUtils]: 55: Hoare triple {26057#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {26057#false} is VALID [2022-04-15 06:05:44,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {26057#false} ~cond := #in~cond; {26057#false} is VALID [2022-04-15 06:05:44,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {26057#false} assume 0 == ~cond; {26057#false} is VALID [2022-04-15 06:05:44,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {26057#false} assume !false; {26057#false} is VALID [2022-04-15 06:05:44,233 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:44,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:48,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {26057#false} assume !false; {26057#false} is VALID [2022-04-15 06:05:48,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {26292#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26057#false} is VALID [2022-04-15 06:05:48,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {26296#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26292#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:05:48,925 INFO L272 TraceCheckUtils]: 55: Hoare triple {26300#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {26296#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:05:48,925 INFO L290 TraceCheckUtils]: 54: Hoare triple {26304#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {26300#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:05:48,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {26308#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26304#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,928 INFO L290 TraceCheckUtils]: 52: Hoare triple {26312#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26308#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,928 INFO L290 TraceCheckUtils]: 51: Hoare triple {26316#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26312#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,930 INFO L290 TraceCheckUtils]: 50: Hoare triple {26320#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26316#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,930 INFO L290 TraceCheckUtils]: 49: Hoare triple {26324#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26320#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {26328#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26324#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,932 INFO L290 TraceCheckUtils]: 47: Hoare triple {26332#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26328#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {26336#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26332#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {26340#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26336#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {26344#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26340#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {26348#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26344#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {26352#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26348#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {26356#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26352#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {26360#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26356#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {26364#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26360#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {26368#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26364#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {26372#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26368#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {26376#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26372#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {26380#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26376#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {26384#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26380#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {26388#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26384#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {26392#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26388#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {26396#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26392#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {26400#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26396#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {26404#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26400#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {26408#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26404#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {26412#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26408#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {26416#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26412#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {26420#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26416#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {26424#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26420#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {26428#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26424#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {26432#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26428#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {26436#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26432#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {26440#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26436#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {26444#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26440#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {26448#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26444#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {26452#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26448#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {26456#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26452#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {26460#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26456#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {26464#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26460#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {26468#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26464#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {26472#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26468#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {26476#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26472#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {26480#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26476#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {26484#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26480#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {26488#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26484#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {26492#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26488#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {26496#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26492#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {26056#true} ~x~0 := 268435441; {26496#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:05:48,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {26056#true} call #t~ret4 := main(); {26056#true} is VALID [2022-04-15 06:05:48,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26056#true} {26056#true} #34#return; {26056#true} is VALID [2022-04-15 06:05:48,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {26056#true} assume true; {26056#true} is VALID [2022-04-15 06:05:48,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {26056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26056#true} is VALID [2022-04-15 06:05:48,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {26056#true} call ULTIMATE.init(); {26056#true} is VALID [2022-04-15 06:05:48,973 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:48,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785901146] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:48,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:48,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 54] total 105 [2022-04-15 06:05:48,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:48,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1594603833] [2022-04-15 06:05:48,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1594603833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:48,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:48,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 06:05:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113556229] [2022-04-15 06:05:48,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:48,974 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:48,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:48,974 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:49,003 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:49,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 06:05:49,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 06:05:49,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=8165, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 06:05:49,004 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:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:53,438 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 06:05:53,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 06:05:53,438 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:53,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:53,438 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:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 06:05:53,439 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:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 06:05:53,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-15 06:05:53,477 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:53,478 INFO L225 Difference]: With dead ends: 66 [2022-04-15 06:05:53,478 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 06:05:53,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5448, Invalid=18114, Unknown=0, NotChecked=0, Total=23562 [2022-04-15 06:05:53,479 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:53,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 06:05:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 06:05:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 06:05:53,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:53,536 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:53,536 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:53,536 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:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:53,537 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-15 06:05:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-15 06:05:53,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:53,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:53,537 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:53,537 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:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:53,538 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-15 06:05:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-15 06:05:53,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:53,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:53,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:53,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:53,538 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:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-15 06:05:53,539 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2022-04-15 06:05:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:53,539 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-15 06:05:53,539 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:53,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-15 06:05:53,586 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:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-15 06:05:53,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 06:05:53,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:53,587 INFO L499 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:53,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-04-15 06:05:53,793 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:53,987 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:53,988 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:53,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2040480650, now seen corresponding path program 97 times [2022-04-15 06:05:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:53,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390687118] [2022-04-15 06:05:54,107 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,108 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:05:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash 969748727, now seen corresponding path program 1 times [2022-04-15 06:05:54,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:54,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333631999] [2022-04-15 06:05:54,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:54,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:54,114 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_49.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:05:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:05:54,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1018331790] [2022-04-15 06:05:54,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:54,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:54,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:54,117 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:54,118 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:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:54,155 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:05:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:05:54,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:05:54,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2040480650, now seen corresponding path program 98 times [2022-04-15 06:05:54,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:54,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923187771] [2022-04-15 06:05:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:55,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:55,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {27046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26991#true} is VALID [2022-04-15 06:05:55,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {26991#true} assume true; {26991#true} is VALID [2022-04-15 06:05:55,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26991#true} {26991#true} #34#return; {26991#true} is VALID [2022-04-15 06:05:55,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {26991#true} call ULTIMATE.init(); {27046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:55,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {27046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26991#true} is VALID [2022-04-15 06:05:55,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {26991#true} assume true; {26991#true} is VALID [2022-04-15 06:05:55,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26991#true} {26991#true} #34#return; {26991#true} is VALID [2022-04-15 06:05:55,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {26991#true} call #t~ret4 := main(); {26991#true} is VALID [2022-04-15 06:05:55,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {26991#true} ~x~0 := 268435441; {26996#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:05:55,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {26996#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26997#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:05:55,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {26997#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26998#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:05:55,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {26998#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26999#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:05:55,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {26999#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27000#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:05:55,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {27000#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27001#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:05:55,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {27001#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27002#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:05:55,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {27002#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27003#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:05:55,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {27003#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27004#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:05:55,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {27004#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27005#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:05:55,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {27005#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27006#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:05:55,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {27006#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27007#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:05:55,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {27007#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27008#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:05:55,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {27008#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27009#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:05:55,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {27009#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27010#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:05:55,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {27010#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27011#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:05:55,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {27011#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27012#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:05:55,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {27012#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27013#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:05:55,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {27013#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27014#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:05:55,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {27014#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27015#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:05:55,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {27015#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27016#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:05:55,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {27016#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27017#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:05:55,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {27017#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27018#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:05:55,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {27018#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27019#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:05:55,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {27019#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27020#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:05:55,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {27020#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27021#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:05:55,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {27021#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27022#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:05:55,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {27022#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27023#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:05:55,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {27023#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27024#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:05:55,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {27024#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27025#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:05:55,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {27025#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27026#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:05:55,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {27026#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27027#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:05:55,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {27027#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27028#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:05:55,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {27028#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27029#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:05:55,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {27029#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27030#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:05:55,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {27030#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27031#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:05:55,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {27031#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27032#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:05:55,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {27032#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27033#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:05:55,383 INFO L290 TraceCheckUtils]: 43: Hoare triple {27033#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27034#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:05:55,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {27034#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27035#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:05:55,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {27035#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27036#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:05:55,385 INFO L290 TraceCheckUtils]: 46: Hoare triple {27036#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27037#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:05:55,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {27037#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27038#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:05:55,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {27038#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27039#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:05:55,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {27039#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27040#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:05:55,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {27040#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27041#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:05:55,387 INFO L290 TraceCheckUtils]: 51: Hoare triple {27041#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27042#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:05:55,387 INFO L290 TraceCheckUtils]: 52: Hoare triple {27042#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27043#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:05:55,388 INFO L290 TraceCheckUtils]: 53: Hoare triple {27043#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27044#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:05:55,388 INFO L290 TraceCheckUtils]: 54: Hoare triple {27044#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27045#(and (<= (div main_~x~0 4294967296) 0) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:05:55,389 INFO L290 TraceCheckUtils]: 55: Hoare triple {27045#(and (<= (div main_~x~0 4294967296) 0) (<= 268435343 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {26992#false} is VALID [2022-04-15 06:05:55,389 INFO L272 TraceCheckUtils]: 56: Hoare triple {26992#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {26992#false} is VALID [2022-04-15 06:05:55,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {26992#false} ~cond := #in~cond; {26992#false} is VALID [2022-04-15 06:05:55,389 INFO L290 TraceCheckUtils]: 58: Hoare triple {26992#false} assume 0 == ~cond; {26992#false} is VALID [2022-04-15 06:05:55,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {26992#false} assume !false; {26992#false} is VALID [2022-04-15 06:05:55,389 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:55,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:55,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923187771] [2022-04-15 06:05:55,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923187771] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:55,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99153843] [2022-04-15 06:05:55,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:05:55,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:55,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:55,390 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:55,391 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:55,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:05:55,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:55,439 WARN L261 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-15 06:05:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:55,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:55,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {26991#true} call ULTIMATE.init(); {26991#true} is VALID [2022-04-15 06:05:55,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {26991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26991#true} is VALID [2022-04-15 06:05:55,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {26991#true} assume true; {26991#true} is VALID [2022-04-15 06:05:55,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26991#true} {26991#true} #34#return; {26991#true} is VALID [2022-04-15 06:05:55,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {26991#true} call #t~ret4 := main(); {26991#true} is VALID [2022-04-15 06:05:55,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {26991#true} ~x~0 := 268435441; {26996#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:05:55,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {26996#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26997#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:05:55,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {26997#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26998#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:05:55,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {26998#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {26999#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:05:55,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {26999#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27000#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:05:55,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {27000#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27001#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:05:55,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {27001#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27002#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:05:55,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {27002#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27003#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:05:55,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {27003#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27004#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:05:55,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {27004#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27005#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:05:55,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {27005#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27006#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:05:55,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {27006#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27007#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:05:55,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {27007#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27008#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:05:55,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {27008#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27009#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:05:55,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {27009#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27010#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:05:55,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {27010#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27011#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:05:55,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {27011#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27012#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:05:55,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {27012#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27013#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:05:55,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {27013#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27014#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:05:55,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {27014#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27015#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:05:55,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {27015#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27016#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:05:55,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {27016#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27017#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:05:55,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {27017#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27018#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:05:55,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {27018#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27019#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:05:55,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {27019#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27020#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:05:55,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {27020#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27021#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:05:55,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {27021#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27022#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:05:55,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {27022#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27023#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:05:55,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {27023#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27024#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:05:55,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {27024#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27025#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:05:55,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {27025#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27026#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:05:55,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {27026#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27027#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:05:55,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {27027#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27028#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:05:55,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {27028#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27029#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:05:55,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {27029#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27030#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:05:55,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {27030#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27031#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:05:55,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {27031#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27032#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:05:55,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {27032#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27033#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:05:55,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {27033#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27034#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:05:55,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {27034#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27035#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:05:55,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {27035#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27036#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:05:55,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {27036#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27037#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:05:55,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {27037#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27038#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:05:55,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {27038#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27039#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:05:55,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {27039#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27040#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:05:55,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {27040#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27041#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:05:55,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {27041#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27042#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:05:55,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {27042#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27043#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:05:55,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {27043#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27044#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:05:55,938 INFO L290 TraceCheckUtils]: 54: Hoare triple {27044#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27212#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:05:55,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {27212#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {26992#false} is VALID [2022-04-15 06:05:55,939 INFO L272 TraceCheckUtils]: 56: Hoare triple {26992#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {26992#false} is VALID [2022-04-15 06:05:55,939 INFO L290 TraceCheckUtils]: 57: Hoare triple {26992#false} ~cond := #in~cond; {26992#false} is VALID [2022-04-15 06:05:55,939 INFO L290 TraceCheckUtils]: 58: Hoare triple {26992#false} assume 0 == ~cond; {26992#false} is VALID [2022-04-15 06:05:55,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {26992#false} assume !false; {26992#false} is VALID [2022-04-15 06:05:55,939 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:55,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:00,764 INFO L290 TraceCheckUtils]: 59: Hoare triple {26992#false} assume !false; {26992#false} is VALID [2022-04-15 06:06:00,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {27231#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26992#false} is VALID [2022-04-15 06:06:00,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {27235#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27231#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:06:00,765 INFO L272 TraceCheckUtils]: 56: Hoare triple {27239#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27235#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:06:00,765 INFO L290 TraceCheckUtils]: 55: Hoare triple {27243#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {27239#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:06:00,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {27247#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27243#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {27251#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27247#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {27255#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27251#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {27259#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27255#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,770 INFO L290 TraceCheckUtils]: 50: Hoare triple {27263#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27259#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {27267#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27263#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {27271#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27267#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {27275#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27271#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {27279#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27275#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {27283#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27279#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {27287#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27283#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,776 INFO L290 TraceCheckUtils]: 43: Hoare triple {27291#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27287#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {27295#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27291#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {27299#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27295#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {27303#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27299#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {27307#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27303#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {27311#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27307#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {27315#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27311#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {27319#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27315#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {27323#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27319#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {27327#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27323#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {27331#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27327#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {27335#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27331#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {27339#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27335#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {27343#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27339#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {27347#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27343#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {27351#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27347#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {27355#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27351#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {27359#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27355#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {27363#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27359#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {27367#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27363#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {27371#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27367#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {27375#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27371#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {27379#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27375#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {27383#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27379#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {27387#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27383#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {27391#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27387#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {27395#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27391#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {27399#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27395#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {27403#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27399#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {27407#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27403#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {27411#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27407#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {27415#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27411#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {27419#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27415#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {27423#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27419#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {27427#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27423#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {27431#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27427#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {27435#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27431#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {27439#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27435#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {26991#true} ~x~0 := 268435441; {27439#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:00,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {26991#true} call #t~ret4 := main(); {26991#true} is VALID [2022-04-15 06:06:00,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26991#true} {26991#true} #34#return; {26991#true} is VALID [2022-04-15 06:06:00,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {26991#true} assume true; {26991#true} is VALID [2022-04-15 06:06:00,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {26991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26991#true} is VALID [2022-04-15 06:06:00,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {26991#true} call ULTIMATE.init(); {26991#true} is VALID [2022-04-15 06:06:00,820 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:06:00,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99153843] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:00,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:00,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 55] total 107 [2022-04-15 06:06:00,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:00,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390687118] [2022-04-15 06:06:00,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390687118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:00,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:00,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 06:06:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015953472] [2022-04-15 06:06:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:00,821 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:06:00,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:00,821 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:06:00,854 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:06:00,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 06:06:00,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:00,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 06:06:00,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8481, Unknown=0, NotChecked=0, Total=11342 [2022-04-15 06:06:00,855 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:06:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:05,636 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-15 06:06:05,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 06:06:05,636 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:06:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:05,638 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:06:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-15 06:06:05,638 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:06:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-15 06:06:05,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-15 06:06:05,677 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:06:05,677 INFO L225 Difference]: With dead ends: 67 [2022-04-15 06:06:05,677 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 06:06:05,678 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5659, Invalid=18833, Unknown=0, NotChecked=0, Total=24492 [2022-04-15 06:06:05,679 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 2647 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:05,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 208 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2647 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 06:06:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 06:06:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-15 06:06:05,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:05,744 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:06:05,744 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:06:05,744 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:06:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:05,744 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 06:06:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 06:06:05,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:05,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:05,747 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:06:05,748 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:06:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:05,755 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 06:06:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 06:06:05,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:05,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:05,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:05,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:05,755 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:06:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2022-04-15 06:06:05,756 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2022-04-15 06:06:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:05,756 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2022-04-15 06:06:05,756 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:06:05,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 62 transitions. [2022-04-15 06:06:05,801 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,801 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 06:06:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 06:06:05,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:05,801 INFO L499 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:05,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-04-15 06:06:06,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2022-04-15 06:06:06,207 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:06:06,207 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:06,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:06,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1206070556, now seen corresponding path program 99 times [2022-04-15 06:06:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:06,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [351036153] [2022-04-15 06:06:06,343 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:06,344 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:06:06,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1028854071, now seen corresponding path program 1 times [2022-04-15 06:06:06,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:06,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278170837] [2022-04-15 06:06:06,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:06,352 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_50.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:06:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:06:06,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103273922] [2022-04-15 06:06:06,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:06,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:06,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:06,356 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:06:06,357 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:06:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:06,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:06:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:06,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:06:06,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1206070556, now seen corresponding path program 100 times [2022-04-15 06:06:06,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:06,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108908249] [2022-04-15 06:06:06,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:06,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:07,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {27998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27942#true} is VALID [2022-04-15 06:06:07,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {27942#true} assume true; {27942#true} is VALID [2022-04-15 06:06:07,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27942#true} {27942#true} #34#return; {27942#true} is VALID [2022-04-15 06:06:07,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {27942#true} call ULTIMATE.init(); {27998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:07,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {27998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27942#true} is VALID [2022-04-15 06:06:07,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {27942#true} assume true; {27942#true} is VALID [2022-04-15 06:06:07,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27942#true} {27942#true} #34#return; {27942#true} is VALID [2022-04-15 06:06:07,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {27942#true} call #t~ret4 := main(); {27942#true} is VALID [2022-04-15 06:06:07,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {27942#true} ~x~0 := 268435441; {27947#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:06:07,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {27947#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27948#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:06:07,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {27948#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27949#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:06:07,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {27949#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27950#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:06:07,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {27950#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27951#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:06:07,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {27951#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27952#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:06:07,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {27952#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27953#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:06:07,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {27953#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27954#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:06:07,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {27954#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27955#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:06:07,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {27955#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27956#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:06:07,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {27956#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27957#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:06:07,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {27957#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27958#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:06:07,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {27958#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27959#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:06:07,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {27959#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27960#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:06:07,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {27960#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27961#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:06:07,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {27961#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27962#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:06:07,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {27962#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27963#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:06:07,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {27963#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27964#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:06:07,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {27964#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27965#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:06:07,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {27965#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27966#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:06:07,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {27966#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27967#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:06:07,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {27967#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27968#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:06:07,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {27968#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27969#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:06:07,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {27969#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27970#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:06:07,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {27970#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27971#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:06:07,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {27971#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27972#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:06:07,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {27972#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27973#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:06:07,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {27973#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27974#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:06:07,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {27974#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27975#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:06:07,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {27975#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27976#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:06:07,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {27976#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27977#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:06:07,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {27977#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27978#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:06:07,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {27978#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27979#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:06:07,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {27979#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27980#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:06:07,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {27980#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27981#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:06:07,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {27981#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27982#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:06:07,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {27982#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27983#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:06:07,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {27983#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27984#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:06:07,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {27984#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27985#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:06:07,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {27985#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27986#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:06:07,664 INFO L290 TraceCheckUtils]: 45: Hoare triple {27986#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27987#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:06:07,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {27987#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27988#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:06:07,665 INFO L290 TraceCheckUtils]: 47: Hoare triple {27988#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27989#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:06:07,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {27989#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27990#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:06:07,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {27990#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27991#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:06:07,667 INFO L290 TraceCheckUtils]: 50: Hoare triple {27991#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27992#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:06:07,667 INFO L290 TraceCheckUtils]: 51: Hoare triple {27992#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27993#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:06:07,668 INFO L290 TraceCheckUtils]: 52: Hoare triple {27993#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27994#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:06:07,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {27994#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27995#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:06:07,669 INFO L290 TraceCheckUtils]: 54: Hoare triple {27995#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27996#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:06:07,669 INFO L290 TraceCheckUtils]: 55: Hoare triple {27996#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27997#(and (<= 268435341 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:06:07,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {27997#(and (<= 268435341 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {27943#false} is VALID [2022-04-15 06:06:07,670 INFO L272 TraceCheckUtils]: 57: Hoare triple {27943#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27943#false} is VALID [2022-04-15 06:06:07,670 INFO L290 TraceCheckUtils]: 58: Hoare triple {27943#false} ~cond := #in~cond; {27943#false} is VALID [2022-04-15 06:06:07,670 INFO L290 TraceCheckUtils]: 59: Hoare triple {27943#false} assume 0 == ~cond; {27943#false} is VALID [2022-04-15 06:06:07,670 INFO L290 TraceCheckUtils]: 60: Hoare triple {27943#false} assume !false; {27943#false} is VALID [2022-04-15 06:06:07,670 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:06:07,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:07,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108908249] [2022-04-15 06:06:07,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108908249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:07,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476596640] [2022-04-15 06:06:07,671 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:06:07,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:07,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:07,672 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:06:07,672 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:06:07,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:06:07,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:07,767 WARN L261 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 103 conjunts are in the unsatisfiable core [2022-04-15 06:06:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:07,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:08,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {27942#true} call ULTIMATE.init(); {27942#true} is VALID [2022-04-15 06:06:08,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {27942#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27942#true} is VALID [2022-04-15 06:06:08,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {27942#true} assume true; {27942#true} is VALID [2022-04-15 06:06:08,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27942#true} {27942#true} #34#return; {27942#true} is VALID [2022-04-15 06:06:08,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {27942#true} call #t~ret4 := main(); {27942#true} is VALID [2022-04-15 06:06:08,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {27942#true} ~x~0 := 268435441; {27947#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:06:08,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {27947#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27948#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:06:08,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {27948#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27949#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:06:08,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {27949#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27950#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:06:08,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {27950#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27951#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:06:08,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {27951#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27952#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:06:08,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {27952#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27953#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:06:08,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {27953#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27954#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:06:08,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {27954#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27955#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:06:08,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {27955#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27956#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:06:08,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {27956#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27957#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:06:08,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {27957#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27958#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:06:08,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {27958#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27959#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:06:08,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {27959#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27960#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:06:08,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {27960#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27961#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:06:08,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {27961#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27962#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:06:08,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {27962#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27963#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:06:08,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {27963#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27964#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:06:08,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {27964#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27965#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:06:08,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {27965#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27966#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:06:08,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {27966#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27967#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:06:08,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {27967#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27968#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:06:08,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {27968#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27969#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:06:08,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {27969#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27970#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:06:08,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {27970#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27971#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:06:08,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {27971#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27972#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:06:08,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {27972#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27973#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:06:08,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {27973#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27974#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:06:08,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {27974#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27975#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:06:08,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {27975#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27976#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:06:08,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {27976#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27977#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:06:08,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {27977#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27978#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:06:08,354 INFO L290 TraceCheckUtils]: 37: Hoare triple {27978#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27979#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:06:08,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {27979#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27980#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:06:08,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {27980#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27981#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:06:08,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {27981#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27982#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:06:08,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {27982#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27983#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:06:08,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {27983#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27984#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:06:08,357 INFO L290 TraceCheckUtils]: 43: Hoare triple {27984#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27985#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:06:08,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {27985#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27986#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:06:08,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {27986#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27987#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:06:08,358 INFO L290 TraceCheckUtils]: 46: Hoare triple {27987#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27988#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:06:08,359 INFO L290 TraceCheckUtils]: 47: Hoare triple {27988#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27989#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:06:08,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {27989#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27990#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:06:08,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {27990#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27991#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:06:08,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {27991#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27992#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:06:08,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {27992#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27993#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:06:08,361 INFO L290 TraceCheckUtils]: 52: Hoare triple {27993#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27994#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:06:08,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {27994#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27995#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:06:08,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {27995#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {27996#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:06:08,362 INFO L290 TraceCheckUtils]: 55: Hoare triple {27996#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28167#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:06:08,363 INFO L290 TraceCheckUtils]: 56: Hoare triple {28167#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !(~x~0 % 4294967296 > 1); {27943#false} is VALID [2022-04-15 06:06:08,363 INFO L272 TraceCheckUtils]: 57: Hoare triple {27943#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27943#false} is VALID [2022-04-15 06:06:08,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {27943#false} ~cond := #in~cond; {27943#false} is VALID [2022-04-15 06:06:08,363 INFO L290 TraceCheckUtils]: 59: Hoare triple {27943#false} assume 0 == ~cond; {27943#false} is VALID [2022-04-15 06:06:08,363 INFO L290 TraceCheckUtils]: 60: Hoare triple {27943#false} assume !false; {27943#false} is VALID [2022-04-15 06:06:08,363 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:06:08,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:12,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {27943#false} assume !false; {27943#false} is VALID [2022-04-15 06:06:12,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {27943#false} assume 0 == ~cond; {27943#false} is VALID [2022-04-15 06:06:12,198 INFO L290 TraceCheckUtils]: 58: Hoare triple {27943#false} ~cond := #in~cond; {27943#false} is VALID [2022-04-15 06:06:12,198 INFO L272 TraceCheckUtils]: 57: Hoare triple {27943#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27943#false} is VALID [2022-04-15 06:06:12,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {28195#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {27943#false} is VALID [2022-04-15 06:06:12,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {28199#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28195#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:06:12,200 INFO L290 TraceCheckUtils]: 54: Hoare triple {28203#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28199#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:06:12,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {28207#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28203#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,202 INFO L290 TraceCheckUtils]: 52: Hoare triple {28211#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28207#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,202 INFO L290 TraceCheckUtils]: 51: Hoare triple {28215#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28211#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,203 INFO L290 TraceCheckUtils]: 50: Hoare triple {28219#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28215#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:06:12,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {28223#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28219#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:06:12,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {28227#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28223#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {28231#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28227#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:06:12,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {28235#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28231#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:06:12,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {28239#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28235#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {28243#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28239#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {28247#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28243#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {28251#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28247#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:06:12,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {28255#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28251#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:06:12,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {28259#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28255#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:06:12,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {28263#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28259#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:06:12,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {28267#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28263#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:06:12,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {28271#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28267#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {28275#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28271#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:06:12,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {28279#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28275#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:06:12,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {28283#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28279#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {28287#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28283#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:06:12,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {28291#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28287#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {28295#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28291#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:06:12,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {28299#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28295#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {28303#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28299#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:06:12,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {28307#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28303#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:06:12,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {28311#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28307#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {28315#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28311#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {28319#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28315#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:06:12,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {28323#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28319#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:06:12,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {28327#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28323#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:06:12,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {28331#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28327#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {28335#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28331#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:06:12,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {28339#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28335#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:06:12,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {28343#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28339#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {28347#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28343#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:06:12,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {28351#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28347#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:06:12,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {28355#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28351#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {28359#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28355#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {28363#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28359#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} is VALID [2022-04-15 06:06:12,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {28367#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28363#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {28371#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28367#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {28375#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28371#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} is VALID [2022-04-15 06:06:12,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {28379#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28375#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {28383#(< 1 (mod (+ 4294967202 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28379#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} is VALID [2022-04-15 06:06:12,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {28387#(< 1 (mod (+ 4294967200 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28383#(< 1 (mod (+ 4294967202 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {28391#(< 1 (mod (+ 4294967198 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28387#(< 1 (mod (+ 4294967200 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {28395#(< 1 (mod (+ 4294967196 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28391#(< 1 (mod (+ 4294967198 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {27942#true} ~x~0 := 268435441; {28395#(< 1 (mod (+ 4294967196 main_~x~0) 4294967296))} is VALID [2022-04-15 06:06:12,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {27942#true} call #t~ret4 := main(); {27942#true} is VALID [2022-04-15 06:06:12,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27942#true} {27942#true} #34#return; {27942#true} is VALID [2022-04-15 06:06:12,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {27942#true} assume true; {27942#true} is VALID [2022-04-15 06:06:12,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {27942#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27942#true} is VALID [2022-04-15 06:06:12,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {27942#true} call ULTIMATE.init(); {27942#true} is VALID [2022-04-15 06:06:12,232 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:06:12,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476596640] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:12,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:12,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 106 [2022-04-15 06:06:12,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:12,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [351036153] [2022-04-15 06:06:12,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [351036153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:12,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:12,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 06:06:12,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807491427] [2022-04-15 06:06:12,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:12,233 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:06:12,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:12,233 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:06:12,279 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:06:12,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 06:06:12,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:12,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 06:06:12,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2912, Invalid=8218, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 06:06:12,280 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:06:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:16,982 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 06:06:16,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 06:06:16,982 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:06:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:16,983 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:06:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-15 06:06:16,983 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:06:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-15 06:06:16,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 68 transitions. [2022-04-15 06:06:17,022 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:06:17,023 INFO L225 Difference]: With dead ends: 68 [2022-04-15 06:06:17,023 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 06:06:17,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5817, Invalid=18675, Unknown=0, NotChecked=0, Total=24492 [2022-04-15 06:06:17,025 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:17,025 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 06:06:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 06:06:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 06:06:17,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:17,095 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:06:17,095 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:06:17,095 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:06:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:17,096 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-15 06:06:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 06:06:17,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:17,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:17,096 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:06:17,096 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:06:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:17,097 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-15 06:06:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 06:06:17,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:17,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:17,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:17,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:17,097 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:06:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-15 06:06:17,098 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2022-04-15 06:06:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:17,098 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-15 06:06:17,098 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:06:17,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-15 06:06:17,141 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:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 06:06:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 06:06:17,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:17,141 INFO L499 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:17,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2022-04-15 06:06:17,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2022-04-15 06:06:17,541 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:06:17,542 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1230057162, now seen corresponding path program 101 times [2022-04-15 06:06:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:17,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [106572566] [2022-04-15 06:06:17,658 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:17,660 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:06:17,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1087959415, now seen corresponding path program 1 times [2022-04-15 06:06:17,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:17,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101273434] [2022-04-15 06:06:17,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:17,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:17,665 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_51.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:06:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:06:17,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007052521] [2022-04-15 06:06:17,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:17,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:17,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:17,668 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:06:17,669 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:06:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:17,706 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:06:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:17,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:06:17,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1230057162, now seen corresponding path program 102 times [2022-04-15 06:06:17,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:17,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555593396] [2022-04-15 06:06:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:19,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:19,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {28963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28906#true} is VALID [2022-04-15 06:06:19,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {28906#true} assume true; {28906#true} is VALID [2022-04-15 06:06:19,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28906#true} {28906#true} #34#return; {28906#true} is VALID [2022-04-15 06:06:19,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {28906#true} call ULTIMATE.init(); {28963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:19,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {28963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28906#true} is VALID [2022-04-15 06:06:19,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {28906#true} assume true; {28906#true} is VALID [2022-04-15 06:06:19,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28906#true} {28906#true} #34#return; {28906#true} is VALID [2022-04-15 06:06:19,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {28906#true} call #t~ret4 := main(); {28906#true} is VALID [2022-04-15 06:06:19,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {28906#true} ~x~0 := 268435441; {28911#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:06:19,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {28911#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28912#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:06:19,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {28912#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28913#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:06:19,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {28913#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28914#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:06:19,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {28914#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28915#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:06:19,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {28915#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28916#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:06:19,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {28916#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28917#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:06:19,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {28917#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28918#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:06:19,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {28918#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28919#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:06:19,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {28919#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28920#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:06:19,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {28920#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28921#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:06:19,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {28921#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28922#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:06:19,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {28922#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28923#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:06:19,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {28923#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28924#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:06:19,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {28924#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28925#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:06:19,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {28925#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28926#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:06:19,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {28926#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28927#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:06:19,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {28927#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28928#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:06:19,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {28928#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28929#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:06:19,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {28929#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28930#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:06:19,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {28930#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28931#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:06:19,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {28931#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28932#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:06:19,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {28932#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28933#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:06:19,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {28933#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28934#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:06:19,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {28934#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28935#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:06:19,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {28935#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28936#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:06:19,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {28936#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28937#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:06:19,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {28937#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28938#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:06:19,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {28938#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28939#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:06:19,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {28939#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28940#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:06:19,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {28940#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28941#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:06:19,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {28941#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28942#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:06:19,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {28942#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28943#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:06:19,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {28943#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28944#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:06:19,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {28944#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28945#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:06:19,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {28945#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28946#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:06:19,029 INFO L290 TraceCheckUtils]: 41: Hoare triple {28946#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28947#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:06:19,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {28947#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28948#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:06:19,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {28948#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28949#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:06:19,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {28949#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28950#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:06:19,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {28950#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28951#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:06:19,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {28951#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28952#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:06:19,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {28952#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28953#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:06:19,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {28953#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28954#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:06:19,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {28954#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28955#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:06:19,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {28955#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28956#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:06:19,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {28956#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28957#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:06:19,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {28957#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28958#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:06:19,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {28958#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28959#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:06:19,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {28959#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28960#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:06:19,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {28960#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28961#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:06:19,037 INFO L290 TraceCheckUtils]: 56: Hoare triple {28961#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28962#(and (<= 268435339 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:06:19,037 INFO L290 TraceCheckUtils]: 57: Hoare triple {28962#(and (<= 268435339 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {28907#false} is VALID [2022-04-15 06:06:19,037 INFO L272 TraceCheckUtils]: 58: Hoare triple {28907#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {28907#false} is VALID [2022-04-15 06:06:19,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {28907#false} ~cond := #in~cond; {28907#false} is VALID [2022-04-15 06:06:19,037 INFO L290 TraceCheckUtils]: 60: Hoare triple {28907#false} assume 0 == ~cond; {28907#false} is VALID [2022-04-15 06:06:19,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {28907#false} assume !false; {28907#false} is VALID [2022-04-15 06:06:19,038 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:19,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:19,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555593396] [2022-04-15 06:06:19,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555593396] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:19,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266349566] [2022-04-15 06:06:19,038 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:06:19,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:19,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:19,041 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:06:19,041 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:06:28,585 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2022-04-15 06:06:28,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:28,593 WARN L261 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-15 06:06:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:28,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:29,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {28906#true} call ULTIMATE.init(); {28906#true} is VALID [2022-04-15 06:06:29,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {28906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28906#true} is VALID [2022-04-15 06:06:29,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {28906#true} assume true; {28906#true} is VALID [2022-04-15 06:06:29,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28906#true} {28906#true} #34#return; {28906#true} is VALID [2022-04-15 06:06:29,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {28906#true} call #t~ret4 := main(); {28906#true} is VALID [2022-04-15 06:06:29,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {28906#true} ~x~0 := 268435441; {28911#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:06:29,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {28911#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28912#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:06:29,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {28912#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28913#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:06:29,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {28913#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28914#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:06:29,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {28914#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28915#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:06:29,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {28915#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28916#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:06:29,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {28916#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28917#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:06:29,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {28917#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28918#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:06:29,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {28918#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28919#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:06:29,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {28919#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28920#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:06:29,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {28920#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28921#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:06:29,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {28921#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28922#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:06:29,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {28922#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28923#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:06:29,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {28923#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28924#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:06:29,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {28924#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28925#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:06:29,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {28925#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28926#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:06:29,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {28926#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28927#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:06:29,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {28927#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28928#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:06:29,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {28928#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28929#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:06:29,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {28929#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28930#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:06:29,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {28930#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28931#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:06:29,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {28931#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28932#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:06:29,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {28932#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28933#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:06:29,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {28933#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28934#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:06:29,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {28934#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28935#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:06:29,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {28935#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28936#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:06:29,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {28936#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28937#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:06:29,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {28937#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28938#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:06:29,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {28938#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28939#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:06:29,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {28939#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28940#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:06:29,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {28940#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28941#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:06:29,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {28941#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28942#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:06:29,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {28942#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28943#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:06:29,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {28943#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28944#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:06:29,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {28944#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28945#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:06:29,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {28945#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28946#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:06:29,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {28946#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28947#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:06:29,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {28947#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28948#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:06:29,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {28948#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28949#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:06:29,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {28949#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28950#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:06:29,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {28950#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28951#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:06:29,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {28951#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28952#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:06:29,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {28952#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28953#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:06:29,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {28953#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28954#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:06:29,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {28954#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28955#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:06:29,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {28955#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28956#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:06:29,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {28956#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28957#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:06:29,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {28957#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28958#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:06:29,096 INFO L290 TraceCheckUtils]: 53: Hoare triple {28958#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28959#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:06:29,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {28959#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28960#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:06:29,096 INFO L290 TraceCheckUtils]: 55: Hoare triple {28960#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {28961#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:06:29,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {28961#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29135#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:06:29,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {29135#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !(~x~0 % 4294967296 > 1); {28907#false} is VALID [2022-04-15 06:06:29,097 INFO L272 TraceCheckUtils]: 58: Hoare triple {28907#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {28907#false} is VALID [2022-04-15 06:06:29,097 INFO L290 TraceCheckUtils]: 59: Hoare triple {28907#false} ~cond := #in~cond; {28907#false} is VALID [2022-04-15 06:06:29,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {28907#false} assume 0 == ~cond; {28907#false} is VALID [2022-04-15 06:06:29,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {28907#false} assume !false; {28907#false} is VALID [2022-04-15 06:06:29,098 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:29,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:34,310 INFO L290 TraceCheckUtils]: 61: Hoare triple {28907#false} assume !false; {28907#false} is VALID [2022-04-15 06:06:34,310 INFO L290 TraceCheckUtils]: 60: Hoare triple {29154#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28907#false} is VALID [2022-04-15 06:06:34,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {29158#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29154#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:06:34,311 INFO L272 TraceCheckUtils]: 58: Hoare triple {29162#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {29158#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:06:34,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {29166#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {29162#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:06:34,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {29170#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29166#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,313 INFO L290 TraceCheckUtils]: 55: Hoare triple {29174#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29170#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,314 INFO L290 TraceCheckUtils]: 54: Hoare triple {29178#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29174#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,316 INFO L290 TraceCheckUtils]: 53: Hoare triple {29182#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29178#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {29186#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29182#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {29190#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29186#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,320 INFO L290 TraceCheckUtils]: 50: Hoare triple {29194#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29190#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {29198#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29194#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {29202#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29198#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {29206#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29202#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {29210#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29206#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {29214#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29210#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {29218#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29214#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {29222#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29218#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {29226#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29222#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {29230#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29226#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {29234#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29230#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {29238#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29234#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {29242#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29238#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {29246#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29242#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {29250#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29246#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {29254#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29250#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {29258#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29254#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {29262#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29258#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {29266#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29262#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {29270#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29266#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {29274#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29270#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {29278#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29274#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {29282#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29278#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {29286#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29282#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {29290#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29286#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {29294#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29290#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {29298#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29294#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {29302#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29298#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {29306#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29302#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {29310#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29306#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {29314#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29310#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {29318#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29314#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {29322#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29318#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {29326#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29322#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {29330#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29326#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {29334#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29330#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {29338#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29334#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {29342#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29338#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {29346#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29342#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {29350#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29346#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {29354#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29350#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {29358#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29354#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {29362#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29358#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {29366#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29362#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {29370#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29366#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {28906#true} ~x~0 := 268435441; {29370#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:34,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {28906#true} call #t~ret4 := main(); {28906#true} is VALID [2022-04-15 06:06:34,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28906#true} {28906#true} #34#return; {28906#true} is VALID [2022-04-15 06:06:34,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {28906#true} assume true; {28906#true} is VALID [2022-04-15 06:06:34,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {28906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28906#true} is VALID [2022-04-15 06:06:34,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {28906#true} call ULTIMATE.init(); {28906#true} is VALID [2022-04-15 06:06:34,364 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:34,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266349566] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:34,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:34,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 57] total 111 [2022-04-15 06:06:34,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:34,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [106572566] [2022-04-15 06:06:34,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [106572566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:34,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:34,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 06:06:34,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536489183] [2022-04-15 06:06:34,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:34,365 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:34,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:34,365 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:34,429 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:34,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 06:06:34,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:34,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 06:06:34,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=9131, Unknown=0, NotChecked=0, Total=12210 [2022-04-15 06:06:34,431 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:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:39,667 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-15 06:06:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 06:06:39,667 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:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:39,667 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:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-15 06:06:39,673 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:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-15 06:06:39,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-15 06:06:39,719 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:39,720 INFO L225 Difference]: With dead ends: 69 [2022-04-15 06:06:39,720 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 06:06:39,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=6093, Invalid=20313, Unknown=0, NotChecked=0, Total=26406 [2022-04-15 06:06:39,721 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:39,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 06:06:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 06:06:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-15 06:06:39,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:39,791 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:39,791 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:39,791 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:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:39,791 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 06:06:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 06:06:39,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:39,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:39,792 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:39,792 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:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:39,792 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 06:06:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 06:06:39,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:39,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:39,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:39,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:39,793 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:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2022-04-15 06:06:39,793 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2022-04-15 06:06:39,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:39,793 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2022-04-15 06:06:39,794 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:39,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 64 transitions. [2022-04-15 06:06:39,876 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:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 06:06:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 06:06:39,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:39,877 INFO L499 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:39,882 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:40,081 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:40,277 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:40,277 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:40,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash 559394908, now seen corresponding path program 103 times [2022-04-15 06:06:40,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:40,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1737927863] [2022-04-15 06:06:40,403 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:40,405 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:06:40,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1147064759, now seen corresponding path program 1 times [2022-04-15 06:06:40,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:40,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194923482] [2022-04-15 06:06:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:40,410 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_52.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)) (- 1))) 0)) [2022-04-15 06:06:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:06:40,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460677199] [2022-04-15 06:06:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:40,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:40,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:40,413 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:40,414 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:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:40,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:06:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:40,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:06:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash 559394908, now seen corresponding path program 104 times [2022-04-15 06:06:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:40,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476218867] [2022-04-15 06:06:40,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:40,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:41,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:41,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {29947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29889#true} is VALID [2022-04-15 06:06:41,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {29889#true} assume true; {29889#true} is VALID [2022-04-15 06:06:41,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29889#true} {29889#true} #34#return; {29889#true} is VALID [2022-04-15 06:06:41,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {29889#true} call ULTIMATE.init(); {29947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:41,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {29947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29889#true} is VALID [2022-04-15 06:06:41,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {29889#true} assume true; {29889#true} is VALID [2022-04-15 06:06:41,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29889#true} {29889#true} #34#return; {29889#true} is VALID [2022-04-15 06:06:41,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {29889#true} call #t~ret4 := main(); {29889#true} is VALID [2022-04-15 06:06:41,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {29889#true} ~x~0 := 268435441; {29894#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:06:41,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {29894#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29895#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:06:41,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {29895#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29896#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:06:41,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {29896#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29897#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:06:41,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {29897#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29898#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:06:41,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {29898#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29899#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:06:41,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {29899#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29900#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:06:41,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {29900#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29901#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:06:41,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {29901#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29902#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:06:41,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {29902#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29903#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:06:41,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {29903#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29904#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:06:41,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {29904#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29905#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:06:41,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {29905#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29906#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:06:41,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {29906#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29907#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:06:41,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {29907#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29908#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:06:41,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {29908#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29909#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:06:41,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {29909#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29910#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:06:41,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {29910#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29911#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:06:41,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {29911#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29912#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:06:41,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {29912#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29913#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:06:41,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {29913#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29914#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:06:41,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {29914#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29915#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:06:41,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {29915#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29916#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:06:41,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {29916#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29917#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:06:41,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {29917#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29918#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:06:41,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {29918#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29919#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:06:41,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {29919#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29920#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:06:41,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {29920#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29921#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:06:41,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {29921#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29922#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:06:41,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {29922#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29923#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:06:41,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {29923#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29924#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:06:41,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {29924#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29925#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:06:41,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {29925#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29926#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:06:41,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {29926#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29927#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:06:41,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {29927#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29928#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:06:41,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {29928#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29929#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:06:41,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {29929#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29930#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:06:41,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {29930#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29931#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:06:41,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {29931#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29932#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:06:41,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {29932#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29933#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:06:41,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {29933#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29934#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:06:41,814 INFO L290 TraceCheckUtils]: 46: Hoare triple {29934#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29935#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:06:41,815 INFO L290 TraceCheckUtils]: 47: Hoare triple {29935#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29936#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:06:41,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {29936#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29937#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:06:41,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {29937#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29938#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:06:41,816 INFO L290 TraceCheckUtils]: 50: Hoare triple {29938#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29939#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:06:41,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {29939#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29940#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:06:41,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {29940#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29941#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:06:41,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {29941#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29942#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:06:41,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {29942#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29943#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:06:41,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {29943#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29944#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:06:41,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {29944#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29945#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:06:41,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {29945#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29946#(and (<= (div main_~x~0 4294967296) 0) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:06:41,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {29946#(and (<= (div main_~x~0 4294967296) 0) (<= 268435337 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {29890#false} is VALID [2022-04-15 06:06:41,820 INFO L272 TraceCheckUtils]: 59: Hoare triple {29890#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {29890#false} is VALID [2022-04-15 06:06:41,820 INFO L290 TraceCheckUtils]: 60: Hoare triple {29890#false} ~cond := #in~cond; {29890#false} is VALID [2022-04-15 06:06:41,820 INFO L290 TraceCheckUtils]: 61: Hoare triple {29890#false} assume 0 == ~cond; {29890#false} is VALID [2022-04-15 06:06:41,820 INFO L290 TraceCheckUtils]: 62: Hoare triple {29890#false} assume !false; {29890#false} is VALID [2022-04-15 06:06:41,821 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:41,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:41,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476218867] [2022-04-15 06:06:41,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476218867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:41,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615215434] [2022-04-15 06:06:41,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:06:41,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:41,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:41,822 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:41,822 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:41,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:06:41,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:41,872 WARN L261 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 110 conjunts are in the unsatisfiable core [2022-04-15 06:06:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:41,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:42,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {29889#true} call ULTIMATE.init(); {29889#true} is VALID [2022-04-15 06:06:42,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {29889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29889#true} is VALID [2022-04-15 06:06:42,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {29889#true} assume true; {29889#true} is VALID [2022-04-15 06:06:42,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29889#true} {29889#true} #34#return; {29889#true} is VALID [2022-04-15 06:06:42,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {29889#true} call #t~ret4 := main(); {29889#true} is VALID [2022-04-15 06:06:42,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {29889#true} ~x~0 := 268435441; {29894#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:06:42,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {29894#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29895#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:06:42,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {29895#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29896#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:06:42,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {29896#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29897#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:06:42,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {29897#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29898#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:06:42,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {29898#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29899#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:06:42,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {29899#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29900#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:06:42,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {29900#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29901#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:06:42,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {29901#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29902#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:06:42,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {29902#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29903#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:06:42,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {29903#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29904#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:06:42,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {29904#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29905#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:06:42,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {29905#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29906#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:06:42,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {29906#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29907#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:06:42,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {29907#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29908#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:06:42,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {29908#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29909#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:06:42,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {29909#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29910#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:06:42,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {29910#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29911#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:06:42,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {29911#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29912#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:06:42,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {29912#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29913#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:06:42,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {29913#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29914#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:06:42,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {29914#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29915#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:06:42,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {29915#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29916#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:06:42,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {29916#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29917#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:06:42,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {29917#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29918#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:06:42,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {29918#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29919#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:06:42,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {29919#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29920#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:06:42,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {29920#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29921#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:06:42,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {29921#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29922#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:06:42,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {29922#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29923#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:06:42,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {29923#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29924#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:06:42,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {29924#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29925#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:06:42,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {29925#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29926#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:06:42,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {29926#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29927#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:06:42,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {29927#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29928#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:06:42,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {29928#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29929#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:06:42,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {29929#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29930#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:06:42,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {29930#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29931#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:06:42,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {29931#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29932#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:06:42,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {29932#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29933#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:06:42,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {29933#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29934#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:06:42,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {29934#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29935#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:06:42,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {29935#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29936#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:06:42,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {29936#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29937#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:06:42,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {29937#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29938#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:06:42,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {29938#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29939#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:06:42,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {29939#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29940#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:06:42,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {29940#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29941#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:06:42,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {29941#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29942#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:06:42,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {29942#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29943#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:06:42,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {29943#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29944#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:06:42,387 INFO L290 TraceCheckUtils]: 56: Hoare triple {29944#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {29945#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:06:42,387 INFO L290 TraceCheckUtils]: 57: Hoare triple {29945#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30122#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:06:42,387 INFO L290 TraceCheckUtils]: 58: Hoare triple {30122#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {29890#false} is VALID [2022-04-15 06:06:42,387 INFO L272 TraceCheckUtils]: 59: Hoare triple {29890#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {29890#false} is VALID [2022-04-15 06:06:42,388 INFO L290 TraceCheckUtils]: 60: Hoare triple {29890#false} ~cond := #in~cond; {29890#false} is VALID [2022-04-15 06:06:42,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {29890#false} assume 0 == ~cond; {29890#false} is VALID [2022-04-15 06:06:42,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {29890#false} assume !false; {29890#false} is VALID [2022-04-15 06:06:42,388 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:42,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:47,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {29890#false} assume !false; {29890#false} is VALID [2022-04-15 06:06:47,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {30141#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29890#false} is VALID [2022-04-15 06:06:47,782 INFO L290 TraceCheckUtils]: 60: Hoare triple {30145#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30141#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:06:47,782 INFO L272 TraceCheckUtils]: 59: Hoare triple {30149#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {30145#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:06:47,782 INFO L290 TraceCheckUtils]: 58: Hoare triple {30153#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {30149#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:06:47,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {30157#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30153#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {30161#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30157#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {30165#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30161#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {30169#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30165#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {30173#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30169#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {30177#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30173#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {30181#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30177#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {30185#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30181#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {30189#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30185#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {30193#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30189#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {30197#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30193#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {30201#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30197#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {30205#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30201#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {30209#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30205#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {30213#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30209#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {30217#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30213#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {30221#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30217#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {30225#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30221#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {30229#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30225#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {30233#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30229#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {30237#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30233#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {30241#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30237#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {30245#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30241#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {30249#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30245#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {30253#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30249#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {30257#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30253#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {30261#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30257#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {30265#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30261#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {30269#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30265#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {30273#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30269#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {30277#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30273#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {30281#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30277#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {30285#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30281#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {30289#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30285#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {30293#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30289#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {30297#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30293#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {30301#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30297#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {30305#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30301#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {30309#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30305#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {30313#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30309#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {30317#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30313#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {30321#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30317#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {30325#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30321#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {30329#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30325#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {30333#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30329#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {30337#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30333#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {30341#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30337#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {30345#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30341#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {30349#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30345#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {30353#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30349#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {30357#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30353#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {30361#(or (< 1 (mod (+ 4294967192 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30357#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {29889#true} ~x~0 := 268435441; {30361#(or (< 1 (mod (+ 4294967192 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:06:47,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {29889#true} call #t~ret4 := main(); {29889#true} is VALID [2022-04-15 06:06:47,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29889#true} {29889#true} #34#return; {29889#true} is VALID [2022-04-15 06:06:47,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {29889#true} assume true; {29889#true} is VALID [2022-04-15 06:06:47,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {29889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29889#true} is VALID [2022-04-15 06:06:47,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {29889#true} call ULTIMATE.init(); {29889#true} is VALID [2022-04-15 06:06:47,843 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:47,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615215434] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:47,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:47,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 58] total 113 [2022-04-15 06:06:47,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:47,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1737927863] [2022-04-15 06:06:47,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1737927863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:47,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:47,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 06:06:47,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733803549] [2022-04-15 06:06:47,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:47,844 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:47,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:47,845 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:47,881 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:47,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 06:06:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:47,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 06:06:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9465, Unknown=0, NotChecked=0, Total=12656 [2022-04-15 06:06:47,882 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:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:53,309 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 06:06:53,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 06:06:53,309 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:53,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:53,309 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:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-15 06:06:53,310 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:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-15 06:06:53,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-15 06:06:53,360 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:53,361 INFO L225 Difference]: With dead ends: 70 [2022-04-15 06:06:53,361 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 06:06:53,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6316, Invalid=21074, Unknown=0, NotChecked=0, Total=27390 [2022-04-15 06:06:53,362 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2843 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:53,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2843 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 06:06:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 06:06:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 06:06:53,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:53,433 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:53,433 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:53,433 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:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:53,434 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-15 06:06:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-15 06:06:53,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:53,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:53,434 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:53,434 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:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:53,435 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-15 06:06:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-15 06:06:53,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:53,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:53,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:53,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:53,435 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:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-04-15 06:06:53,435 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2022-04-15 06:06:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:53,436 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-04-15 06:06:53,436 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:53,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 65 transitions. [2022-04-15 06:06:53,484 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:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-15 06:06:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 06:06:53,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:53,484 INFO L499 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:53,504 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:53,726 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:53,885 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:53,885 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:53,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash 197834230, now seen corresponding path program 105 times [2022-04-15 06:06:53,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:53,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704276859] [2022-04-15 06:06:54,021 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:54,023 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:06:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1206170103, now seen corresponding path program 1 times [2022-04-15 06:06:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:54,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503122208] [2022-04-15 06:06:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:54,028 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_53.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:06:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:06:54,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667352878] [2022-04-15 06:06:54,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:54,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:54,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:54,032 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:54,033 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:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:54,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:06:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:06:54,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:06:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash 197834230, now seen corresponding path program 106 times [2022-04-15 06:06:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:54,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818435071] [2022-04-15 06:06:54,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:54,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:55,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:55,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {30947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30888#true} is VALID [2022-04-15 06:06:55,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {30888#true} assume true; {30888#true} is VALID [2022-04-15 06:06:55,476 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30888#true} {30888#true} #34#return; {30888#true} is VALID [2022-04-15 06:06:55,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {30888#true} call ULTIMATE.init(); {30947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:55,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {30947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30888#true} is VALID [2022-04-15 06:06:55,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {30888#true} assume true; {30888#true} is VALID [2022-04-15 06:06:55,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30888#true} {30888#true} #34#return; {30888#true} is VALID [2022-04-15 06:06:55,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {30888#true} call #t~ret4 := main(); {30888#true} is VALID [2022-04-15 06:06:55,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {30888#true} ~x~0 := 268435441; {30893#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:06:55,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {30893#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30894#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:06:55,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {30894#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30895#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:06:55,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {30895#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30896#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:06:55,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {30896#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30897#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:06:55,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {30897#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30898#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:06:55,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {30898#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30899#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:06:55,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {30899#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30900#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:06:55,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {30900#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30901#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:06:55,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {30901#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30902#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:06:55,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {30902#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30903#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:06:55,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {30903#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30904#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:06:55,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {30904#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30905#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:06:55,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {30905#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30906#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:06:55,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {30906#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30907#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:06:55,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {30907#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30908#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:06:55,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {30908#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30909#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:06:55,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {30909#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30910#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:06:55,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {30910#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30911#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:06:55,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {30911#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30912#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:06:55,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {30912#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30913#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:06:55,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {30913#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30914#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:06:55,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {30914#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30915#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:06:55,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {30915#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30916#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:06:55,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {30916#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30917#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:06:55,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {30917#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30918#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:06:55,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {30918#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30919#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:06:55,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {30919#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30920#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:06:55,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {30920#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30921#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:06:55,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {30921#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30922#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:06:55,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {30922#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30923#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:06:55,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {30923#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30924#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:06:55,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {30924#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30925#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:06:55,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {30925#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30926#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:06:55,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {30926#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30927#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:06:55,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {30927#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30928#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:06:55,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {30928#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30929#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:06:55,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {30929#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30930#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:06:55,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {30930#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30931#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:06:55,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {30931#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30932#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:06:55,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {30932#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30933#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:06:55,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {30933#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30934#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:06:55,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {30934#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30935#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:06:55,497 INFO L290 TraceCheckUtils]: 48: Hoare triple {30935#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30936#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:06:55,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {30936#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30937#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:06:55,498 INFO L290 TraceCheckUtils]: 50: Hoare triple {30937#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30938#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:06:55,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {30938#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30939#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:06:55,499 INFO L290 TraceCheckUtils]: 52: Hoare triple {30939#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30940#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:06:55,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {30940#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30941#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:06:55,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {30941#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30942#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:06:55,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {30942#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30943#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:06:55,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {30943#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30944#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:06:55,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {30944#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30945#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:06:55,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {30945#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30946#(and (<= (div main_~x~0 4294967296) 0) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:06:55,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {30946#(and (<= (div main_~x~0 4294967296) 0) (<= 268435335 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {30889#false} is VALID [2022-04-15 06:06:55,502 INFO L272 TraceCheckUtils]: 60: Hoare triple {30889#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {30889#false} is VALID [2022-04-15 06:06:55,503 INFO L290 TraceCheckUtils]: 61: Hoare triple {30889#false} ~cond := #in~cond; {30889#false} is VALID [2022-04-15 06:06:55,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {30889#false} assume 0 == ~cond; {30889#false} is VALID [2022-04-15 06:06:55,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {30889#false} assume !false; {30889#false} is VALID [2022-04-15 06:06:55,503 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:55,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:55,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818435071] [2022-04-15 06:06:55,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818435071] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:55,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048699581] [2022-04-15 06:06:55,503 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:06:55,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:55,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:55,504 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:55,505 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:55,630 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:06:55,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:55,631 WARN L261 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 109 conjunts are in the unsatisfiable core [2022-04-15 06:06:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:55,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:56,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {30888#true} call ULTIMATE.init(); {30888#true} is VALID [2022-04-15 06:06:56,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {30888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30888#true} is VALID [2022-04-15 06:06:56,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {30888#true} assume true; {30888#true} is VALID [2022-04-15 06:06:56,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30888#true} {30888#true} #34#return; {30888#true} is VALID [2022-04-15 06:06:56,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {30888#true} call #t~ret4 := main(); {30888#true} is VALID [2022-04-15 06:06:56,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {30888#true} ~x~0 := 268435441; {30893#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:06:56,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {30893#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30894#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:06:56,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {30894#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30895#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:06:56,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {30895#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30896#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:06:56,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {30896#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30897#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:06:56,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {30897#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30898#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:06:56,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {30898#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30899#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:06:56,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {30899#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30900#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:06:56,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {30900#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30901#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:06:56,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {30901#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30902#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:06:56,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {30902#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30903#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:06:56,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {30903#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30904#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:06:56,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {30904#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30905#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:06:56,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {30905#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30906#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:06:56,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {30906#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30907#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:06:56,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {30907#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30908#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:06:56,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {30908#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30909#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:06:56,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {30909#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30910#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:06:56,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {30910#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30911#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:06:56,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {30911#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30912#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:06:56,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {30912#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30913#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:06:56,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {30913#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30914#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:06:56,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {30914#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30915#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:06:56,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {30915#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30916#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:06:56,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {30916#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30917#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:06:56,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {30917#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30918#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:06:56,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {30918#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30919#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:06:56,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {30919#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30920#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:06:56,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {30920#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30921#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:06:56,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {30921#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30922#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:06:56,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {30922#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30923#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:06:56,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {30923#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30924#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:06:56,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {30924#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30925#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:06:56,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {30925#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30926#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:06:56,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {30926#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30927#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:06:56,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {30927#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30928#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:06:56,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {30928#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30929#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:06:56,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {30929#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30930#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:06:56,210 INFO L290 TraceCheckUtils]: 43: Hoare triple {30930#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30931#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:06:56,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {30931#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30932#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:06:56,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {30932#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30933#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:06:56,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {30933#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30934#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:06:56,212 INFO L290 TraceCheckUtils]: 47: Hoare triple {30934#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30935#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:06:56,212 INFO L290 TraceCheckUtils]: 48: Hoare triple {30935#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30936#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:06:56,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {30936#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30937#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:06:56,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {30937#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30938#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:06:56,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {30938#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30939#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:06:56,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {30939#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30940#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:06:56,215 INFO L290 TraceCheckUtils]: 53: Hoare triple {30940#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30941#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:06:56,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {30941#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30942#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:06:56,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {30942#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30943#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:06:56,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {30943#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30944#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:06:56,216 INFO L290 TraceCheckUtils]: 57: Hoare triple {30944#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {30945#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:06:56,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {30945#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31125#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:06:56,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {31125#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {30889#false} is VALID [2022-04-15 06:06:56,217 INFO L272 TraceCheckUtils]: 60: Hoare triple {30889#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {30889#false} is VALID [2022-04-15 06:06:56,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {30889#false} ~cond := #in~cond; {30889#false} is VALID [2022-04-15 06:06:56,218 INFO L290 TraceCheckUtils]: 62: Hoare triple {30889#false} assume 0 == ~cond; {30889#false} is VALID [2022-04-15 06:06:56,218 INFO L290 TraceCheckUtils]: 63: Hoare triple {30889#false} assume !false; {30889#false} is VALID [2022-04-15 06:06:56,218 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:56,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:00,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {30889#false} assume !false; {30889#false} is VALID [2022-04-15 06:07:00,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {30889#false} assume 0 == ~cond; {30889#false} is VALID [2022-04-15 06:07:00,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {30889#false} ~cond := #in~cond; {30889#false} is VALID [2022-04-15 06:07:00,468 INFO L272 TraceCheckUtils]: 60: Hoare triple {30889#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {30889#false} is VALID [2022-04-15 06:07:00,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {31153#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {30889#false} is VALID [2022-04-15 06:07:00,469 INFO L290 TraceCheckUtils]: 58: Hoare triple {31157#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31153#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:07:00,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {31161#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31157#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:07:00,473 INFO L290 TraceCheckUtils]: 56: Hoare triple {31165#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31161#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {31169#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31165#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {31173#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31169#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,476 INFO L290 TraceCheckUtils]: 53: Hoare triple {31177#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31173#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:07:00,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {31181#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31177#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:07:00,478 INFO L290 TraceCheckUtils]: 51: Hoare triple {31185#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31181#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,478 INFO L290 TraceCheckUtils]: 50: Hoare triple {31189#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31185#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:07:00,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {31193#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31189#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:07:00,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {31197#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31193#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,480 INFO L290 TraceCheckUtils]: 47: Hoare triple {31201#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31197#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {31205#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31201#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {31209#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31205#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:07:00,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {31213#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31209#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:07:00,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {31217#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31213#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:07:00,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {31221#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31217#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:07:00,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {31225#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31221#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:07:00,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {31229#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31225#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {31233#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31229#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:07:00,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {31237#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31233#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:07:00,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {31241#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31237#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {31245#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31241#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:07:00,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {31249#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31245#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {31253#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31249#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:07:00,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {31257#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31253#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {31261#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31257#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:07:00,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {31265#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31261#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:07:00,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {31269#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31265#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {31273#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31269#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {31277#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31273#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:07:00,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {31281#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31277#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:07:00,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {31285#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31281#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:07:00,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {31289#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31285#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {31293#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31289#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:07:00,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {31297#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31293#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:07:00,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {31301#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31297#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {31305#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31301#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:07:00,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {31309#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31305#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:07:00,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {31313#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31309#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {31317#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31313#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {31321#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31317#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} is VALID [2022-04-15 06:07:00,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {31325#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31321#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {31329#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31325#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {31333#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31329#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} is VALID [2022-04-15 06:07:00,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {31337#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31333#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {31341#(< 1 (mod (+ 4294967202 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31337#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} is VALID [2022-04-15 06:07:00,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {31345#(< 1 (mod (+ 4294967200 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31341#(< 1 (mod (+ 4294967202 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {31349#(< 1 (mod (+ 4294967198 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31345#(< 1 (mod (+ 4294967200 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {31353#(< 1 (mod (+ 4294967196 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31349#(< 1 (mod (+ 4294967198 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {31357#(< 1 (mod (+ 4294967194 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31353#(< 1 (mod (+ 4294967196 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {31361#(< 1 (mod (+ 4294967192 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31357#(< 1 (mod (+ 4294967194 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {31365#(< 1 (mod (+ main_~x~0 4294967190) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31361#(< 1 (mod (+ 4294967192 main_~x~0) 4294967296))} is VALID [2022-04-15 06:07:00,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {30888#true} ~x~0 := 268435441; {31365#(< 1 (mod (+ main_~x~0 4294967190) 4294967296))} is VALID [2022-04-15 06:07:00,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {30888#true} call #t~ret4 := main(); {30888#true} is VALID [2022-04-15 06:07:00,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30888#true} {30888#true} #34#return; {30888#true} is VALID [2022-04-15 06:07:00,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {30888#true} assume true; {30888#true} is VALID [2022-04-15 06:07:00,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {30888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30888#true} is VALID [2022-04-15 06:07:00,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {30888#true} call ULTIMATE.init(); {30888#true} is VALID [2022-04-15 06:07:00,512 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:07:00,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048699581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:00,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:00,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 112 [2022-04-15 06:07:00,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:00,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704276859] [2022-04-15 06:07:00,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704276859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:00,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:00,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 06:07:00,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129891742] [2022-04-15 06:07:00,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:00,513 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:07:00,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:00,513 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:07:00,546 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:07:00,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 06:07:00,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 06:07:00,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=9187, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 06:07:00,548 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:07:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:06,226 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-15 06:07:06,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 06:07:06,226 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:07:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:06,226 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:07:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-15 06:07:06,227 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:07:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-15 06:07:06,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 71 transitions. [2022-04-15 06:07:06,267 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:07:06,268 INFO L225 Difference]: With dead ends: 71 [2022-04-15 06:07:06,268 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 06:07:06,269 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1542 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=6483, Invalid=20907, Unknown=0, NotChecked=0, Total=27390 [2022-04-15 06:07:06,270 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2979 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:06,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2979 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 06:07:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 06:07:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-15 06:07:06,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:06,332 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:07:06,332 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:07:06,332 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:07:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:06,333 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 06:07:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-15 06:07:06,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:06,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:06,333 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:07:06,333 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:07:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:06,334 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 06:07:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-15 06:07:06,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:06,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:06,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:06,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:06,334 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:07:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2022-04-15 06:07:06,335 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2022-04-15 06:07:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:06,335 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2022-04-15 06:07:06,335 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:07:06,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 66 transitions. [2022-04-15 06:07:06,388 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:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-15 06:07:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 06:07:06,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:06,388 INFO L499 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:06,393 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:07:06,605 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:07:06,788 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:07:06,789 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:06,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:06,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1874355100, now seen corresponding path program 107 times [2022-04-15 06:07:06,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:06,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1227084339] [2022-04-15 06:07:06,932 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:06,934 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:07:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1265275447, now seen corresponding path program 1 times [2022-04-15 06:07:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:06,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617859090] [2022-04-15 06:07:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:06,944 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_54.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:07:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:07:06,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562168684] [2022-04-15 06:07:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:06,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:06,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:06,952 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:07:06,952 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:07:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:06,974 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:07:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:06,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:07:06,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1874355100, now seen corresponding path program 108 times [2022-04-15 06:07:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:06,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570725779] [2022-04-15 06:07:06,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:06,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:08,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:08,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {31960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31900#true} is VALID [2022-04-15 06:07:08,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {31900#true} assume true; {31900#true} is VALID [2022-04-15 06:07:08,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31900#true} {31900#true} #34#return; {31900#true} is VALID [2022-04-15 06:07:08,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {31900#true} call ULTIMATE.init(); {31960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:08,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {31960#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31900#true} is VALID [2022-04-15 06:07:08,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {31900#true} assume true; {31900#true} is VALID [2022-04-15 06:07:08,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31900#true} {31900#true} #34#return; {31900#true} is VALID [2022-04-15 06:07:08,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {31900#true} call #t~ret4 := main(); {31900#true} is VALID [2022-04-15 06:07:08,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {31900#true} ~x~0 := 268435441; {31905#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:07:08,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {31905#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31906#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:07:08,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {31906#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31907#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:07:08,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {31907#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31908#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:07:08,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {31908#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31909#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:07:08,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {31909#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31910#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:07:08,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {31910#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31911#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:07:08,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {31911#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31912#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:07:08,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {31912#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31913#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:07:08,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {31913#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31914#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:07:08,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {31914#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31915#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:07:08,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {31915#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31916#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:07:08,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {31916#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31917#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:07:08,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {31917#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31918#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:07:08,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {31918#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31919#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:07:08,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {31919#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31920#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:07:08,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {31920#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31921#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:07:08,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {31921#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31922#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:07:08,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {31922#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31923#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:07:08,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {31923#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31924#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:07:08,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {31924#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31925#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:07:08,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {31925#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31926#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:07:08,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {31926#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31927#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:07:08,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {31927#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31928#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:07:08,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {31928#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31929#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:07:08,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {31929#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31930#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:07:08,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {31930#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31931#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:07:08,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {31931#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31932#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:07:08,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {31932#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31933#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:07:08,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {31933#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31934#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:07:08,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {31934#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31935#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:07:08,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {31935#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31936#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:07:08,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {31936#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31937#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:07:08,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {31937#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31938#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:07:08,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {31938#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31939#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:07:08,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {31939#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31940#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:07:08,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {31940#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31941#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:07:08,408 INFO L290 TraceCheckUtils]: 42: Hoare triple {31941#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31942#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:07:08,408 INFO L290 TraceCheckUtils]: 43: Hoare triple {31942#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31943#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:07:08,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {31943#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31944#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:07:08,409 INFO L290 TraceCheckUtils]: 45: Hoare triple {31944#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31945#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:07:08,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {31945#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31946#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:07:08,410 INFO L290 TraceCheckUtils]: 47: Hoare triple {31946#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31947#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:07:08,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {31947#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31948#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:07:08,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {31948#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31949#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:07:08,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {31949#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31950#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:07:08,412 INFO L290 TraceCheckUtils]: 51: Hoare triple {31950#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31951#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:07:08,412 INFO L290 TraceCheckUtils]: 52: Hoare triple {31951#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31952#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:07:08,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {31952#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31953#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:07:08,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {31953#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31954#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:07:08,414 INFO L290 TraceCheckUtils]: 55: Hoare triple {31954#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31955#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:07:08,414 INFO L290 TraceCheckUtils]: 56: Hoare triple {31955#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31956#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:07:08,415 INFO L290 TraceCheckUtils]: 57: Hoare triple {31956#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31957#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:07:08,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {31957#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31958#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:07:08,416 INFO L290 TraceCheckUtils]: 59: Hoare triple {31958#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31959#(and (<= (div main_~x~0 4294967296) 0) (<= 268435333 main_~x~0))} is VALID [2022-04-15 06:07:08,416 INFO L290 TraceCheckUtils]: 60: Hoare triple {31959#(and (<= (div main_~x~0 4294967296) 0) (<= 268435333 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {31901#false} is VALID [2022-04-15 06:07:08,416 INFO L272 TraceCheckUtils]: 61: Hoare triple {31901#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {31901#false} is VALID [2022-04-15 06:07:08,416 INFO L290 TraceCheckUtils]: 62: Hoare triple {31901#false} ~cond := #in~cond; {31901#false} is VALID [2022-04-15 06:07:08,416 INFO L290 TraceCheckUtils]: 63: Hoare triple {31901#false} assume 0 == ~cond; {31901#false} is VALID [2022-04-15 06:07:08,416 INFO L290 TraceCheckUtils]: 64: Hoare triple {31901#false} assume !false; {31901#false} is VALID [2022-04-15 06:07:08,417 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:07:08,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:08,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570725779] [2022-04-15 06:07:08,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570725779] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:08,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56496973] [2022-04-15 06:07:08,417 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:07:08,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:08,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:08,418 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:07:08,433 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:07:25,348 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-15 06:07:25,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:25,357 WARN L261 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 114 conjunts are in the unsatisfiable core [2022-04-15 06:07:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:25,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:25,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {31900#true} call ULTIMATE.init(); {31900#true} is VALID [2022-04-15 06:07:25,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {31900#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31900#true} is VALID [2022-04-15 06:07:25,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {31900#true} assume true; {31900#true} is VALID [2022-04-15 06:07:25,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31900#true} {31900#true} #34#return; {31900#true} is VALID [2022-04-15 06:07:25,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {31900#true} call #t~ret4 := main(); {31900#true} is VALID [2022-04-15 06:07:25,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {31900#true} ~x~0 := 268435441; {31905#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:07:25,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {31905#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31906#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:07:25,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {31906#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31907#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:07:25,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {31907#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31908#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:07:25,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {31908#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31909#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:07:25,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {31909#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31910#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:07:25,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {31910#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31911#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:07:25,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {31911#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31912#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:07:25,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {31912#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31913#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:07:25,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {31913#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31914#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:07:25,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {31914#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31915#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:07:25,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {31915#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31916#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:07:25,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {31916#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31917#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:07:25,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {31917#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31918#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:07:25,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {31918#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31919#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:07:25,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {31919#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31920#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:07:25,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {31920#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31921#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:07:25,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {31921#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31922#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:07:25,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {31922#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31923#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:07:25,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {31923#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31924#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:07:25,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {31924#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31925#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:07:25,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {31925#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31926#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:07:25,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {31926#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31927#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:07:25,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {31927#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31928#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:07:25,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {31928#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31929#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:07:25,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {31929#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31930#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:07:25,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {31930#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31931#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:07:25,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {31931#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31932#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:07:25,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {31932#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31933#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:07:25,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {31933#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31934#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:07:25,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {31934#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31935#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:07:25,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {31935#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31936#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:07:25,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {31936#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31937#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:07:25,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {31937#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31938#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:07:25,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {31938#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31939#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:07:25,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {31939#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31940#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:07:25,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {31940#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31941#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:07:25,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {31941#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31942#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:07:25,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {31942#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31943#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:07:25,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {31943#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31944#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:07:25,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {31944#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31945#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:07:25,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {31945#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31946#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:07:25,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {31946#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31947#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:07:25,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {31947#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31948#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:07:25,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {31948#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31949#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:07:25,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {31949#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31950#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:07:25,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {31950#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31951#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:07:25,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {31951#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31952#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:07:25,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {31952#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31953#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:07:25,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {31953#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31954#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:07:25,884 INFO L290 TraceCheckUtils]: 55: Hoare triple {31954#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31955#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:07:25,884 INFO L290 TraceCheckUtils]: 56: Hoare triple {31955#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31956#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:07:25,885 INFO L290 TraceCheckUtils]: 57: Hoare triple {31956#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31957#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:07:25,885 INFO L290 TraceCheckUtils]: 58: Hoare triple {31957#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {31958#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:07:25,886 INFO L290 TraceCheckUtils]: 59: Hoare triple {31958#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32141#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:07:25,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {32141#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !(~x~0 % 4294967296 > 1); {31901#false} is VALID [2022-04-15 06:07:25,886 INFO L272 TraceCheckUtils]: 61: Hoare triple {31901#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {31901#false} is VALID [2022-04-15 06:07:25,886 INFO L290 TraceCheckUtils]: 62: Hoare triple {31901#false} ~cond := #in~cond; {31901#false} is VALID [2022-04-15 06:07:25,886 INFO L290 TraceCheckUtils]: 63: Hoare triple {31901#false} assume 0 == ~cond; {31901#false} is VALID [2022-04-15 06:07:25,886 INFO L290 TraceCheckUtils]: 64: Hoare triple {31901#false} assume !false; {31901#false} is VALID [2022-04-15 06:07:25,887 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:07:25,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:31,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {31901#false} assume !false; {31901#false} is VALID [2022-04-15 06:07:31,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {32160#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31901#false} is VALID [2022-04-15 06:07:31,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {32164#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32160#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:31,669 INFO L272 TraceCheckUtils]: 61: Hoare triple {32168#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {32164#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:07:31,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {32172#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {32168#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:07:31,671 INFO L290 TraceCheckUtils]: 59: Hoare triple {32176#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32172#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,673 INFO L290 TraceCheckUtils]: 58: Hoare triple {32180#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32176#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,673 INFO L290 TraceCheckUtils]: 57: Hoare triple {32184#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32180#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {32188#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32184#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,676 INFO L290 TraceCheckUtils]: 55: Hoare triple {32192#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32188#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {32196#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32192#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {32200#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32196#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,679 INFO L290 TraceCheckUtils]: 52: Hoare triple {32204#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32200#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {32208#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32204#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,681 INFO L290 TraceCheckUtils]: 50: Hoare triple {32212#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32208#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {32216#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32212#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {32220#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32216#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {32224#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32220#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,685 INFO L290 TraceCheckUtils]: 46: Hoare triple {32228#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32224#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {32232#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32228#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {32236#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32232#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {32240#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32236#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {32244#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32240#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {32248#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32244#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {32252#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32248#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {32256#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32252#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {32260#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32256#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {32264#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32260#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {32268#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32264#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {32272#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32268#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {32276#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32272#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {32280#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32276#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {32284#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32280#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {32288#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32284#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {32292#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32288#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {32296#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32292#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {32300#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32296#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {32304#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32300#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {32308#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32304#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {32312#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32308#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {32316#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32312#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {32320#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32316#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {32324#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32320#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {32328#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32324#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {32332#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32328#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {32336#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32332#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {32340#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32336#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {32344#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32340#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {32348#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32344#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {32352#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32348#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {32356#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32352#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {32360#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32356#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {32364#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32360#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {32368#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32364#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {32372#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32368#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {32376#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32372#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {32380#(or (< 1 (mod (+ 4294967192 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32376#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {32384#(or (< 1 (mod (+ main_~x~0 4294967190) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32380#(or (< 1 (mod (+ 4294967192 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {32388#(or (< 1 (mod (+ 4294967188 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32384#(or (< 1 (mod (+ main_~x~0 4294967190) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {31900#true} ~x~0 := 268435441; {32388#(or (< 1 (mod (+ 4294967188 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:31,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {31900#true} call #t~ret4 := main(); {31900#true} is VALID [2022-04-15 06:07:31,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31900#true} {31900#true} #34#return; {31900#true} is VALID [2022-04-15 06:07:31,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {31900#true} assume true; {31900#true} is VALID [2022-04-15 06:07:31,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {31900#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31900#true} is VALID [2022-04-15 06:07:31,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {31900#true} call ULTIMATE.init(); {31900#true} is VALID [2022-04-15 06:07:31,751 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:07:31,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56496973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:31,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:31,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 60] total 117 [2022-04-15 06:07:31,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:31,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1227084339] [2022-04-15 06:07:31,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1227084339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:31,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:31,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 06:07:31,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929364133] [2022-04-15 06:07:31,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:31,753 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:31,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:31,753 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:07:31,784 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:07:31,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 06:07:31,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:31,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 06:07:31,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=10151, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 06:07:31,785 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:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:37,978 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 06:07:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 06:07:37,978 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:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:37,978 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:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-15 06:07:37,979 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:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-15 06:07:37,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 72 transitions. [2022-04-15 06:07:38,020 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:38,021 INFO L225 Difference]: With dead ends: 72 [2022-04-15 06:07:38,021 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 06:07:38,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1604 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=6774, Invalid=22638, Unknown=0, NotChecked=0, Total=29412 [2022-04-15 06:07:38,022 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3122 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 3233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:38,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3122 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 06:07:38,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 06:07:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-15 06:07:38,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:38,097 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:38,097 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:38,097 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:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:38,098 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-15 06:07:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-15 06:07:38,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:38,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:38,098 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:38,098 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:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:38,099 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-15 06:07:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-15 06:07:38,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:38,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:38,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:38,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:38,099 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:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-15 06:07:38,100 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2022-04-15 06:07:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:38,100 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-15 06:07:38,100 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:38,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-15 06:07:38,146 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:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-15 06:07:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 06:07:38,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:38,147 INFO L499 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:38,159 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:38,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2022-04-15 06:07:38,551 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:38,551 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1988072778, now seen corresponding path program 109 times [2022-04-15 06:07:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:38,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1033292351] [2022-04-15 06:07:38,664 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:38,666 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:07:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1324380791, now seen corresponding path program 1 times [2022-04-15 06:07:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:38,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069983869] [2022-04-15 06:07:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:38,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:38,682 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_55.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:07:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:07:38,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988269063] [2022-04-15 06:07:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:38,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:38,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:38,691 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:38,691 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:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:38,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:07:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:38,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:07:38,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1988072778, now seen corresponding path program 110 times [2022-04-15 06:07:38,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:38,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737981327] [2022-04-15 06:07:38,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:38,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:40,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:40,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {32992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32931#true} is VALID [2022-04-15 06:07:40,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {32931#true} assume true; {32931#true} is VALID [2022-04-15 06:07:40,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32931#true} {32931#true} #34#return; {32931#true} is VALID [2022-04-15 06:07:40,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {32931#true} call ULTIMATE.init(); {32992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:40,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {32992#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32931#true} is VALID [2022-04-15 06:07:40,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {32931#true} assume true; {32931#true} is VALID [2022-04-15 06:07:40,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32931#true} {32931#true} #34#return; {32931#true} is VALID [2022-04-15 06:07:40,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {32931#true} call #t~ret4 := main(); {32931#true} is VALID [2022-04-15 06:07:40,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {32931#true} ~x~0 := 268435441; {32936#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:07:40,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {32936#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32937#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:07:40,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {32937#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32938#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:07:40,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {32938#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32939#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:07:40,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {32939#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32940#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:07:40,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {32940#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32941#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:07:40,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {32941#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32942#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:07:40,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {32942#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32943#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:07:40,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {32943#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32944#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:07:40,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {32944#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32945#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:07:40,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {32945#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32946#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:07:40,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {32946#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32947#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:07:40,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {32947#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32948#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:07:40,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {32948#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32949#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:07:40,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {32949#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32950#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:07:40,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {32950#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32951#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:07:40,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {32951#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32952#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:07:40,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {32952#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32953#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:07:40,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {32953#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32954#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:07:40,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {32954#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32955#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:07:40,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {32955#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32956#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:07:40,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {32956#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32957#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:07:40,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {32957#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32958#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:07:40,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {32958#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32959#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:07:40,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {32959#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32960#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:07:40,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {32960#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32961#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:07:40,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {32961#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32962#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:07:40,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {32962#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32963#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:07:40,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {32963#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32964#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:07:40,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {32964#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32965#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:07:40,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {32965#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32966#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:07:40,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {32966#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32967#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:07:40,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {32967#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32968#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:07:40,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {32968#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32969#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:07:40,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {32969#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32970#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:07:40,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {32970#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32971#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:07:40,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {32971#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32972#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:07:40,266 INFO L290 TraceCheckUtils]: 42: Hoare triple {32972#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32973#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:07:40,266 INFO L290 TraceCheckUtils]: 43: Hoare triple {32973#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32974#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:07:40,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {32974#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32975#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:07:40,267 INFO L290 TraceCheckUtils]: 45: Hoare triple {32975#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32976#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:07:40,268 INFO L290 TraceCheckUtils]: 46: Hoare triple {32976#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32977#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:07:40,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {32977#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32978#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:07:40,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {32978#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32979#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:07:40,269 INFO L290 TraceCheckUtils]: 49: Hoare triple {32979#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32980#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:07:40,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {32980#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32981#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:07:40,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {32981#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32982#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:07:40,271 INFO L290 TraceCheckUtils]: 52: Hoare triple {32982#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32983#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:07:40,271 INFO L290 TraceCheckUtils]: 53: Hoare triple {32983#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32984#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:07:40,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {32984#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32985#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:07:40,272 INFO L290 TraceCheckUtils]: 55: Hoare triple {32985#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32986#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:07:40,273 INFO L290 TraceCheckUtils]: 56: Hoare triple {32986#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32987#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:07:40,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {32987#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32988#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:07:40,274 INFO L290 TraceCheckUtils]: 58: Hoare triple {32988#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32989#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:07:40,274 INFO L290 TraceCheckUtils]: 59: Hoare triple {32989#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32990#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:07:40,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {32990#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32991#(and (<= 268435331 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:07:40,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {32991#(and (<= 268435331 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {32932#false} is VALID [2022-04-15 06:07:40,275 INFO L272 TraceCheckUtils]: 62: Hoare triple {32932#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {32932#false} is VALID [2022-04-15 06:07:40,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {32932#false} ~cond := #in~cond; {32932#false} is VALID [2022-04-15 06:07:40,275 INFO L290 TraceCheckUtils]: 64: Hoare triple {32932#false} assume 0 == ~cond; {32932#false} is VALID [2022-04-15 06:07:40,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {32932#false} assume !false; {32932#false} is VALID [2022-04-15 06:07:40,276 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:40,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:40,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737981327] [2022-04-15 06:07:40,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737981327] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:40,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972340620] [2022-04-15 06:07:40,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:07:40,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:40,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:40,277 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:40,278 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:40,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:07:40,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:40,336 WARN L261 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-15 06:07:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:40,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:40,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {32931#true} call ULTIMATE.init(); {32931#true} is VALID [2022-04-15 06:07:40,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {32931#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32931#true} is VALID [2022-04-15 06:07:40,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {32931#true} assume true; {32931#true} is VALID [2022-04-15 06:07:40,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32931#true} {32931#true} #34#return; {32931#true} is VALID [2022-04-15 06:07:40,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {32931#true} call #t~ret4 := main(); {32931#true} is VALID [2022-04-15 06:07:40,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {32931#true} ~x~0 := 268435441; {32936#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:07:40,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {32936#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32937#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:07:40,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {32937#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32938#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:07:40,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {32938#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32939#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:07:40,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {32939#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32940#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:07:40,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {32940#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32941#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:07:40,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {32941#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32942#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:07:40,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {32942#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32943#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:07:40,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {32943#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32944#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:07:40,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {32944#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32945#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:07:40,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {32945#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32946#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:07:40,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {32946#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32947#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:07:40,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {32947#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32948#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:07:40,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {32948#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32949#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:07:40,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {32949#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32950#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:07:40,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {32950#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32951#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:07:40,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {32951#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32952#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:07:40,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {32952#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32953#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:07:40,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {32953#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32954#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:07:40,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {32954#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32955#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:07:40,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {32955#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32956#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:07:40,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {32956#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32957#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:07:40,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {32957#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32958#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:07:40,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {32958#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32959#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:07:40,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {32959#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32960#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:07:40,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {32960#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32961#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:07:40,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {32961#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32962#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:07:40,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {32962#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32963#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:07:40,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {32963#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32964#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:07:40,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {32964#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32965#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:07:40,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {32965#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32966#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:07:40,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {32966#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32967#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:07:40,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {32967#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32968#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:07:40,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {32968#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32969#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:07:40,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {32969#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32970#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:07:40,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {32970#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32971#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:07:40,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {32971#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32972#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:07:40,926 INFO L290 TraceCheckUtils]: 42: Hoare triple {32972#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32973#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:07:40,927 INFO L290 TraceCheckUtils]: 43: Hoare triple {32973#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32974#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:07:40,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {32974#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32975#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:07:40,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {32975#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32976#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:07:40,928 INFO L290 TraceCheckUtils]: 46: Hoare triple {32976#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32977#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:07:40,929 INFO L290 TraceCheckUtils]: 47: Hoare triple {32977#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32978#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:07:40,929 INFO L290 TraceCheckUtils]: 48: Hoare triple {32978#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32979#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:07:40,930 INFO L290 TraceCheckUtils]: 49: Hoare triple {32979#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32980#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:07:40,930 INFO L290 TraceCheckUtils]: 50: Hoare triple {32980#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32981#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:07:40,931 INFO L290 TraceCheckUtils]: 51: Hoare triple {32981#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32982#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:07:40,932 INFO L290 TraceCheckUtils]: 52: Hoare triple {32982#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32983#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:07:40,932 INFO L290 TraceCheckUtils]: 53: Hoare triple {32983#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32984#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:07:40,933 INFO L290 TraceCheckUtils]: 54: Hoare triple {32984#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32985#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:07:40,933 INFO L290 TraceCheckUtils]: 55: Hoare triple {32985#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32986#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:07:40,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {32986#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32987#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:07:40,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {32987#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32988#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:07:40,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {32988#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32989#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:07:40,935 INFO L290 TraceCheckUtils]: 59: Hoare triple {32989#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {32990#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:07:40,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {32990#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33176#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} is VALID [2022-04-15 06:07:40,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {33176#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} assume !(~x~0 % 4294967296 > 1); {32932#false} is VALID [2022-04-15 06:07:40,936 INFO L272 TraceCheckUtils]: 62: Hoare triple {32932#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {32932#false} is VALID [2022-04-15 06:07:40,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {32932#false} ~cond := #in~cond; {32932#false} is VALID [2022-04-15 06:07:40,936 INFO L290 TraceCheckUtils]: 64: Hoare triple {32932#false} assume 0 == ~cond; {32932#false} is VALID [2022-04-15 06:07:40,937 INFO L290 TraceCheckUtils]: 65: Hoare triple {32932#false} assume !false; {32932#false} is VALID [2022-04-15 06:07:40,937 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:40,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:47,067 INFO L290 TraceCheckUtils]: 65: Hoare triple {32932#false} assume !false; {32932#false} is VALID [2022-04-15 06:07:47,068 INFO L290 TraceCheckUtils]: 64: Hoare triple {33195#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32932#false} is VALID [2022-04-15 06:07:47,068 INFO L290 TraceCheckUtils]: 63: Hoare triple {33199#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33195#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:47,068 INFO L272 TraceCheckUtils]: 62: Hoare triple {33203#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {33199#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:07:47,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {33207#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {33203#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:07:47,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {33211#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33207#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,071 INFO L290 TraceCheckUtils]: 59: Hoare triple {33215#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33211#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {33219#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33215#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,073 INFO L290 TraceCheckUtils]: 57: Hoare triple {33223#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33219#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {33227#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33223#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {33231#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33227#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {33235#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33231#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {33239#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33235#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {33243#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33239#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,079 INFO L290 TraceCheckUtils]: 51: Hoare triple {33247#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33243#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,079 INFO L290 TraceCheckUtils]: 50: Hoare triple {33251#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33247#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {33255#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33251#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {33259#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33255#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {33263#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33259#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {33267#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33263#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {33271#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33267#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {33275#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33271#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {33279#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33275#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {33283#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33279#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,092 INFO L290 TraceCheckUtils]: 41: Hoare triple {33287#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33283#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {33291#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33287#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {33295#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33291#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {33299#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33295#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {33303#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33299#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {33307#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33303#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {33311#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33307#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {33315#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33311#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {33319#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33315#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {33323#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33319#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {33327#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33323#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {33331#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33327#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {33335#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33331#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {33339#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33335#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {33343#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33339#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {33347#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33343#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {33351#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33347#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {33355#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33351#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {33359#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33355#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {33363#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33359#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {33367#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33363#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {33371#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33367#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {33375#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33371#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {33379#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33375#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {33383#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33379#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {33387#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33383#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {33391#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33387#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {33395#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33391#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {33399#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33395#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {33403#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33399#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {33407#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33403#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {33411#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33407#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {33415#(or (< 1 (mod (+ 4294967192 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33411#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {33419#(or (< 1 (mod (+ main_~x~0 4294967190) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33415#(or (< 1 (mod (+ 4294967192 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {33423#(or (< 1 (mod (+ 4294967188 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33419#(or (< 1 (mod (+ main_~x~0 4294967190) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {33427#(or (< 1 (mod (+ main_~x~0 4294967186) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33423#(or (< 1 (mod (+ 4294967188 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {32931#true} ~x~0 := 268435441; {33427#(or (< 1 (mod (+ main_~x~0 4294967186) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:07:47,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {32931#true} call #t~ret4 := main(); {32931#true} is VALID [2022-04-15 06:07:47,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32931#true} {32931#true} #34#return; {32931#true} is VALID [2022-04-15 06:07:47,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {32931#true} assume true; {32931#true} is VALID [2022-04-15 06:07:47,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {32931#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32931#true} is VALID [2022-04-15 06:07:47,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {32931#true} call ULTIMATE.init(); {32931#true} is VALID [2022-04-15 06:07:47,129 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:47,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972340620] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:47,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:47,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 61] total 119 [2022-04-15 06:07:47,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:47,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1033292351] [2022-04-15 06:07:47,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1033292351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:47,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:47,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 06:07:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939334136] [2022-04-15 06:07:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:47,130 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:47,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:47,130 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:47,162 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:47,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 06:07:47,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:47,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 06:07:47,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3539, Invalid=10503, Unknown=0, NotChecked=0, Total=14042 [2022-04-15 06:07:47,164 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:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:53,462 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-15 06:07:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 06:07:53,462 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:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:53,462 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:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-15 06:07:53,463 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:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-15 06:07:53,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 73 transitions. [2022-04-15 06:07:53,510 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:53,510 INFO L225 Difference]: With dead ends: 73 [2022-04-15 06:07:53,510 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 06:07:53,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=7009, Invalid=23441, Unknown=0, NotChecked=0, Total=30450 [2022-04-15 06:07:53,512 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 3257 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 3370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:53,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 188 Invalid, 3370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3257 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 06:07:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 06:07:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-15 06:07:53,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:53,582 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:53,582 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:53,582 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:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:53,583 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 06:07:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-15 06:07:53,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:53,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:53,583 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:53,583 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:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:53,584 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 06:07:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-15 06:07:53,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:53,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:53,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:53,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:53,585 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:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2022-04-15 06:07:53,585 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2022-04-15 06:07:53,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:53,585 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2022-04-15 06:07:53,586 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:53,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 68 transitions. [2022-04-15 06:07:53,636 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:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-15 06:07:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 06:07:53,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:53,637 INFO L499 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:53,641 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:53,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2022-04-15 06:07:54,041 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:54,041 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252708, now seen corresponding path program 111 times [2022-04-15 06:07:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:54,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1643836803] [2022-04-15 06:07:54,165 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:54,167 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:07:54,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1383486135, now seen corresponding path program 1 times [2022-04-15 06:07:54,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:54,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323707331] [2022-04-15 06:07:54,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:54,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:54,173 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_56.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:07:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:07:54,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689146078] [2022-04-15 06:07:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:54,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:54,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:54,187 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:54,188 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:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:54,228 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:07:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:54,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:07:54,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252708, now seen corresponding path program 112 times [2022-04-15 06:07:54,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:54,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836895984] [2022-04-15 06:07:54,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:54,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:55,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {34040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33978#true} is VALID [2022-04-15 06:07:55,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {33978#true} assume true; {33978#true} is VALID [2022-04-15 06:07:55,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33978#true} {33978#true} #34#return; {33978#true} is VALID [2022-04-15 06:07:55,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {33978#true} call ULTIMATE.init(); {34040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:55,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {34040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33978#true} is VALID [2022-04-15 06:07:55,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {33978#true} assume true; {33978#true} is VALID [2022-04-15 06:07:55,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33978#true} {33978#true} #34#return; {33978#true} is VALID [2022-04-15 06:07:55,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {33978#true} call #t~ret4 := main(); {33978#true} is VALID [2022-04-15 06:07:55,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {33978#true} ~x~0 := 268435441; {33983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:07:55,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {33983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:07:55,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {33984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:07:55,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {33985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:07:55,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {33986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:07:55,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {33987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:07:55,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {33988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:07:55,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {33989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:07:55,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {33990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:07:55,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {33991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:07:55,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {33992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:07:55,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {33993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:07:55,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {33994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:07:55,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {33995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:07:55,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {33996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:07:55,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {33997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:07:55,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {33998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:07:55,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {33999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:07:55,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {34000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:07:55,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {34001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:07:55,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {34002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:07:55,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {34003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:07:55,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {34004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:07:55,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {34005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:07:55,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {34006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:07:55,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {34007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:07:55,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {34008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:07:55,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {34009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:07:55,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {34010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:07:55,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {34011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:07:55,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {34012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:07:55,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {34013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:07:55,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {34014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:07:55,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {34015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34016#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:07:55,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {34016#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34017#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:07:55,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {34017#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34018#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:07:55,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {34018#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34019#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:07:55,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {34019#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34020#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:07:55,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {34020#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34021#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:07:55,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {34021#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34022#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:07:55,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {34022#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34023#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:07:55,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {34023#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34024#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:07:55,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {34024#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34025#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:07:55,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {34025#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34026#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:07:55,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {34026#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34027#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:07:55,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {34027#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34028#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:07:55,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {34028#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34029#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:07:55,731 INFO L290 TraceCheckUtils]: 52: Hoare triple {34029#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34030#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:07:55,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {34030#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34031#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:07:55,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {34031#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34032#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:07:55,732 INFO L290 TraceCheckUtils]: 55: Hoare triple {34032#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34033#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:07:55,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {34033#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34034#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:07:55,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {34034#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34035#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:07:55,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {34035#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34036#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:07:55,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {34036#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34037#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:07:55,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {34037#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34038#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} is VALID [2022-04-15 06:07:55,735 INFO L290 TraceCheckUtils]: 61: Hoare triple {34038#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34039#(and (<= (div main_~x~0 4294967296) 0) (<= 268435329 main_~x~0))} is VALID [2022-04-15 06:07:55,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {34039#(and (<= (div main_~x~0 4294967296) 0) (<= 268435329 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {33979#false} is VALID [2022-04-15 06:07:55,736 INFO L272 TraceCheckUtils]: 63: Hoare triple {33979#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {33979#false} is VALID [2022-04-15 06:07:55,736 INFO L290 TraceCheckUtils]: 64: Hoare triple {33979#false} ~cond := #in~cond; {33979#false} is VALID [2022-04-15 06:07:55,736 INFO L290 TraceCheckUtils]: 65: Hoare triple {33979#false} assume 0 == ~cond; {33979#false} is VALID [2022-04-15 06:07:55,736 INFO L290 TraceCheckUtils]: 66: Hoare triple {33979#false} assume !false; {33979#false} is VALID [2022-04-15 06:07:55,736 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:55,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:55,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836895984] [2022-04-15 06:07:55,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836895984] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:55,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355310203] [2022-04-15 06:07:55,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:07:55,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:55,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:55,738 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:55,738 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:55,875 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:07:55,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:55,877 WARN L261 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 115 conjunts are in the unsatisfiable core [2022-04-15 06:07:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:55,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:56,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {33978#true} call ULTIMATE.init(); {33978#true} is VALID [2022-04-15 06:07:56,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {33978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33978#true} is VALID [2022-04-15 06:07:56,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {33978#true} assume true; {33978#true} is VALID [2022-04-15 06:07:56,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33978#true} {33978#true} #34#return; {33978#true} is VALID [2022-04-15 06:07:56,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {33978#true} call #t~ret4 := main(); {33978#true} is VALID [2022-04-15 06:07:56,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {33978#true} ~x~0 := 268435441; {33983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:07:56,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {33983#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:07:56,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {33984#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:07:56,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {33985#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:07:56,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {33986#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:07:56,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {33987#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:07:56,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {33988#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:07:56,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {33989#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:07:56,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {33990#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:07:56,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {33991#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:07:56,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {33992#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:07:56,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {33993#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:07:56,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {33994#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:07:56,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {33995#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:07:56,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {33996#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:07:56,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {33997#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:07:56,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {33998#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {33999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:07:56,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {33999#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:07:56,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {34000#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:07:56,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {34001#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:07:56,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {34002#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:07:56,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {34003#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:07:56,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {34004#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:07:56,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {34005#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:07:56,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {34006#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:07:56,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {34007#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:07:56,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {34008#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:07:56,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {34009#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:07:56,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {34010#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:07:56,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {34011#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:07:56,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {34012#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:07:56,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {34013#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:07:56,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {34014#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:07:56,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {34015#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34016#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:07:56,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {34016#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34017#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:07:56,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {34017#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34018#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:07:56,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {34018#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34019#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:07:56,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {34019#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34020#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:07:56,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {34020#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34021#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:07:56,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {34021#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34022#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:07:56,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {34022#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34023#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:07:56,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {34023#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34024#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:07:56,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {34024#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34025#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:07:56,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {34025#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34026#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:07:56,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {34026#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34027#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:07:56,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {34027#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34028#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:07:56,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {34028#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34029#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:07:56,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {34029#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34030#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:07:56,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {34030#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34031#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:07:56,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {34031#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34032#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:07:56,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {34032#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34033#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:07:56,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {34033#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34034#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:07:56,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {34034#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34035#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:07:56,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {34035#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34036#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:07:56,505 INFO L290 TraceCheckUtils]: 59: Hoare triple {34036#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34037#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:07:56,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {34037#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34038#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} is VALID [2022-04-15 06:07:56,506 INFO L290 TraceCheckUtils]: 61: Hoare triple {34038#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34227#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} is VALID [2022-04-15 06:07:56,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {34227#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {33979#false} is VALID [2022-04-15 06:07:56,506 INFO L272 TraceCheckUtils]: 63: Hoare triple {33979#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {33979#false} is VALID [2022-04-15 06:07:56,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {33979#false} ~cond := #in~cond; {33979#false} is VALID [2022-04-15 06:07:56,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {33979#false} assume 0 == ~cond; {33979#false} is VALID [2022-04-15 06:07:56,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {33979#false} assume !false; {33979#false} is VALID [2022-04-15 06:07:56,507 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:56,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:08:01,333 INFO L290 TraceCheckUtils]: 66: Hoare triple {33979#false} assume !false; {33979#false} is VALID [2022-04-15 06:08:01,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {33979#false} assume 0 == ~cond; {33979#false} is VALID [2022-04-15 06:08:01,334 INFO L290 TraceCheckUtils]: 64: Hoare triple {33979#false} ~cond := #in~cond; {33979#false} is VALID [2022-04-15 06:08:01,334 INFO L272 TraceCheckUtils]: 63: Hoare triple {33979#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {33979#false} is VALID [2022-04-15 06:08:01,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {34255#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {33979#false} is VALID [2022-04-15 06:08:01,335 INFO L290 TraceCheckUtils]: 61: Hoare triple {34259#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34255#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:08:01,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {34263#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34259#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:08:01,336 INFO L290 TraceCheckUtils]: 59: Hoare triple {34267#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34263#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {34271#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34267#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {34275#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34271#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {34279#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34275#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:08:01,339 INFO L290 TraceCheckUtils]: 55: Hoare triple {34283#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34279#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:08:01,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {34287#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34283#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {34291#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34287#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:08:01,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {34295#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34291#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:08:01,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {34299#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34295#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,342 INFO L290 TraceCheckUtils]: 50: Hoare triple {34303#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34299#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {34307#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34303#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {34311#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34307#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:08:01,345 INFO L290 TraceCheckUtils]: 47: Hoare triple {34315#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34311#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:08:01,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {34319#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34315#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:08:01,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {34323#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34319#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:08:01,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {34327#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34323#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:08:01,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {34331#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34327#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {34335#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34331#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:08:01,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {34339#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34335#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:08:01,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {34343#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34339#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {34347#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34343#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:08:01,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {34351#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34347#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {34355#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34351#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:08:01,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {34359#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34355#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {34363#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34359#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:08:01,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {34367#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34363#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:08:01,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {34371#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34367#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {34375#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34371#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {34379#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34375#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:08:01,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {34383#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34379#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:08:01,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {34387#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34383#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:08:01,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {34391#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34387#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {34395#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34391#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:08:01,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {34399#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34395#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:08:01,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {34403#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34399#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {34407#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34403#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:08:01,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {34411#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34407#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:08:01,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {34415#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34411#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {34419#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34415#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {34423#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34419#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} is VALID [2022-04-15 06:08:01,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {34427#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34423#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {34431#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34427#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {34435#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34431#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} is VALID [2022-04-15 06:08:01,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {34439#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34435#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {34443#(< 1 (mod (+ 4294967202 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34439#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} is VALID [2022-04-15 06:08:01,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {34447#(< 1 (mod (+ 4294967200 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34443#(< 1 (mod (+ 4294967202 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {34451#(< 1 (mod (+ 4294967198 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34447#(< 1 (mod (+ 4294967200 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {34455#(< 1 (mod (+ 4294967196 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34451#(< 1 (mod (+ 4294967198 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {34459#(< 1 (mod (+ 4294967194 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34455#(< 1 (mod (+ 4294967196 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {34463#(< 1 (mod (+ 4294967192 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34459#(< 1 (mod (+ 4294967194 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {34467#(< 1 (mod (+ main_~x~0 4294967190) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34463#(< 1 (mod (+ 4294967192 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {34471#(< 1 (mod (+ 4294967188 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34467#(< 1 (mod (+ main_~x~0 4294967190) 4294967296))} is VALID [2022-04-15 06:08:01,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {34475#(< 1 (mod (+ main_~x~0 4294967186) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34471#(< 1 (mod (+ 4294967188 main_~x~0) 4294967296))} is VALID [2022-04-15 06:08:01,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {34479#(< 1 (mod (+ main_~x~0 4294967184) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {34475#(< 1 (mod (+ main_~x~0 4294967186) 4294967296))} is VALID [2022-04-15 06:08:01,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {33978#true} ~x~0 := 268435441; {34479#(< 1 (mod (+ main_~x~0 4294967184) 4294967296))} is VALID [2022-04-15 06:08:01,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {33978#true} call #t~ret4 := main(); {33978#true} is VALID [2022-04-15 06:08:01,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33978#true} {33978#true} #34#return; {33978#true} is VALID [2022-04-15 06:08:01,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {33978#true} assume true; {33978#true} is VALID [2022-04-15 06:08:01,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {33978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33978#true} is VALID [2022-04-15 06:08:01,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {33978#true} call ULTIMATE.init(); {33978#true} is VALID [2022-04-15 06:08:01,375 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:08:01,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355310203] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:08:01,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:08:01,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 118 [2022-04-15 06:08:01,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:08:01,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1643836803] [2022-04-15 06:08:01,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1643836803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:01,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:01,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 06:08:01,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958079674] [2022-04-15 06:08:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:08:01,376 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:08:01,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:08:01,377 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:08:01,415 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:08:01,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 06:08:01,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:01,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 06:08:01,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=10210, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 06:08:01,417 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:08:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:07,469 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-15 06:08:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 06:08:07,469 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:08:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:07,469 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:08:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-15 06:08:07,470 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:08:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-15 06:08:07,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-15 06:08:07,513 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:08:07,514 INFO L225 Difference]: With dead ends: 74 [2022-04-15 06:08:07,514 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 06:08:07,516 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1713 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=7185, Invalid=23265, Unknown=0, NotChecked=0, Total=30450 [2022-04-15 06:08:07,516 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3329 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 3444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:08:07,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 148 Invalid, 3444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3329 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 06:08:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 06:08:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-15 06:08:07,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:07,593 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:08:07,593 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:08:07,594 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:08:07,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:07,594 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-15 06:08:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-15 06:08:07,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:07,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:07,595 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:08:07,595 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:08:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:07,595 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-15 06:08:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-15 06:08:07,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:07,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:07,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:07,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:07,596 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:08:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-04-15 06:08:07,596 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2022-04-15 06:08:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:07,596 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-04-15 06:08:07,596 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:08:07,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 69 transitions. [2022-04-15 06:08:07,653 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:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-15 06:08:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 06:08:07,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:07,654 INFO L499 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:07,670 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:08:07,857 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:08:08,054 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:08:08,054 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:08,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:08,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1889267574, now seen corresponding path program 113 times [2022-04-15 06:08:08,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:08,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [896524095] [2022-04-15 06:08:08,167 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:08,169 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:08:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1442591479, now seen corresponding path program 1 times [2022-04-15 06:08:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:08,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772123378] [2022-04-15 06:08:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:08,174 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_57.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:08:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:08:08,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223182] [2022-04-15 06:08:08,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:08,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:08,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:08,178 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:08:08,178 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:08:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:08:08,215 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:08:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:08:08,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:08:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1889267574, now seen corresponding path program 114 times [2022-04-15 06:08:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:08,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361889473] [2022-04-15 06:08:08,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:08,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:09,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:09,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {35101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35038#true} is VALID [2022-04-15 06:08:09,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {35038#true} assume true; {35038#true} is VALID [2022-04-15 06:08:09,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35038#true} {35038#true} #34#return; {35038#true} is VALID [2022-04-15 06:08:09,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {35038#true} call ULTIMATE.init(); {35101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:08:09,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {35101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35038#true} is VALID [2022-04-15 06:08:09,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {35038#true} assume true; {35038#true} is VALID [2022-04-15 06:08:09,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35038#true} {35038#true} #34#return; {35038#true} is VALID [2022-04-15 06:08:09,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {35038#true} call #t~ret4 := main(); {35038#true} is VALID [2022-04-15 06:08:09,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {35038#true} ~x~0 := 268435441; {35043#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:08:09,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {35043#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35044#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:08:09,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {35044#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35045#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:08:09,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {35045#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35046#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:08:09,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {35046#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35047#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:08:09,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {35047#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35048#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:08:09,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {35048#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35049#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:08:09,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {35049#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35050#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:08:09,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {35050#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35051#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:08:09,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {35051#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35052#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:08:09,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {35052#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35053#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:08:09,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {35053#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35054#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:08:09,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {35054#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35055#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:08:09,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {35055#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35056#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:08:09,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {35056#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35057#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:08:09,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {35057#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35058#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:08:09,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {35058#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35059#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:08:09,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {35059#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35060#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:08:09,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {35060#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35061#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:08:09,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {35061#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35062#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:08:09,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {35062#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35063#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:08:09,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {35063#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35064#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:08:09,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {35064#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35065#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:08:09,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {35065#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35066#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:08:09,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {35066#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35067#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:08:09,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {35067#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35068#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:08:09,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {35068#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35069#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:08:09,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {35069#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35070#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:08:09,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {35070#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35071#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:08:09,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {35071#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35072#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:08:09,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {35072#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35073#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:08:09,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {35073#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35074#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:08:09,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {35074#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35075#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:08:09,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {35075#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35076#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:08:09,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {35076#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35077#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:08:09,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {35077#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35078#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:08:09,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {35078#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35079#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:08:09,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {35079#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35080#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:08:09,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {35080#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35081#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:08:09,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {35081#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35082#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:08:09,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {35082#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35083#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:08:09,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {35083#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35084#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:08:09,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {35084#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35085#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:08:09,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {35085#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35086#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:08:09,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {35086#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35087#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:08:09,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {35087#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35088#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:08:09,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {35088#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35089#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:08:09,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {35089#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35090#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:08:09,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {35090#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35091#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:08:09,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {35091#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35092#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:08:09,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {35092#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35093#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:08:09,822 INFO L290 TraceCheckUtils]: 56: Hoare triple {35093#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35094#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:08:09,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {35094#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35095#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:08:09,823 INFO L290 TraceCheckUtils]: 58: Hoare triple {35095#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35096#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:08:09,823 INFO L290 TraceCheckUtils]: 59: Hoare triple {35096#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35097#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:08:09,823 INFO L290 TraceCheckUtils]: 60: Hoare triple {35097#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35098#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} is VALID [2022-04-15 06:08:09,824 INFO L290 TraceCheckUtils]: 61: Hoare triple {35098#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35099#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} is VALID [2022-04-15 06:08:09,824 INFO L290 TraceCheckUtils]: 62: Hoare triple {35099#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35100#(and (<= (div main_~x~0 4294967296) 0) (<= 268435327 main_~x~0))} is VALID [2022-04-15 06:08:09,825 INFO L290 TraceCheckUtils]: 63: Hoare triple {35100#(and (<= (div main_~x~0 4294967296) 0) (<= 268435327 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {35039#false} is VALID [2022-04-15 06:08:09,825 INFO L272 TraceCheckUtils]: 64: Hoare triple {35039#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {35039#false} is VALID [2022-04-15 06:08:09,825 INFO L290 TraceCheckUtils]: 65: Hoare triple {35039#false} ~cond := #in~cond; {35039#false} is VALID [2022-04-15 06:08:09,825 INFO L290 TraceCheckUtils]: 66: Hoare triple {35039#false} assume 0 == ~cond; {35039#false} is VALID [2022-04-15 06:08:09,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {35039#false} assume !false; {35039#false} is VALID [2022-04-15 06:08:09,825 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:08:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:09,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361889473] [2022-04-15 06:08:09,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361889473] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:09,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137183050] [2022-04-15 06:08:09,826 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:08:09,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:09,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:09,827 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:08:09,827 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:08:26,446 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2022-04-15 06:08:26,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:08:26,453 WARN L261 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-15 06:08:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:26,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:08:26,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {35038#true} call ULTIMATE.init(); {35038#true} is VALID [2022-04-15 06:08:26,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {35038#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35038#true} is VALID [2022-04-15 06:08:26,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {35038#true} assume true; {35038#true} is VALID [2022-04-15 06:08:26,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35038#true} {35038#true} #34#return; {35038#true} is VALID [2022-04-15 06:08:26,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {35038#true} call #t~ret4 := main(); {35038#true} is VALID [2022-04-15 06:08:26,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {35038#true} ~x~0 := 268435441; {35043#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:08:26,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {35043#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35044#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:08:26,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {35044#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35045#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:08:26,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {35045#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35046#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:08:26,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {35046#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35047#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:08:26,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {35047#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35048#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:08:26,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {35048#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35049#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:08:26,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {35049#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35050#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:08:26,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {35050#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35051#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:08:26,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {35051#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35052#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:08:26,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {35052#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35053#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:08:26,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {35053#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35054#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:08:26,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {35054#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35055#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:08:26,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {35055#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35056#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:08:26,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {35056#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35057#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:08:26,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {35057#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35058#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:08:26,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {35058#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35059#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:08:26,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {35059#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35060#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:08:26,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {35060#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35061#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:08:26,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {35061#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35062#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:08:26,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {35062#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35063#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:08:26,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {35063#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35064#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:08:26,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {35064#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35065#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:08:27,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {35065#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35066#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:08:27,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {35066#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35067#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:08:27,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {35067#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35068#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:08:27,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {35068#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35069#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:08:27,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {35069#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35070#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:08:27,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {35070#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35071#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:08:27,002 INFO L290 TraceCheckUtils]: 34: Hoare triple {35071#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35072#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:08:27,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {35072#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35073#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:08:27,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {35073#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35074#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:08:27,004 INFO L290 TraceCheckUtils]: 37: Hoare triple {35074#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35075#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:08:27,004 INFO L290 TraceCheckUtils]: 38: Hoare triple {35075#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35076#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:08:27,005 INFO L290 TraceCheckUtils]: 39: Hoare triple {35076#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35077#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:08:27,005 INFO L290 TraceCheckUtils]: 40: Hoare triple {35077#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35078#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:08:27,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {35078#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35079#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:08:27,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {35079#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35080#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:08:27,007 INFO L290 TraceCheckUtils]: 43: Hoare triple {35080#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35081#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:08:27,007 INFO L290 TraceCheckUtils]: 44: Hoare triple {35081#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35082#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:08:27,007 INFO L290 TraceCheckUtils]: 45: Hoare triple {35082#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35083#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:08:27,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {35083#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35084#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:08:27,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {35084#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35085#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:08:27,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {35085#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35086#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:08:27,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {35086#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35087#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:08:27,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {35087#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35088#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:08:27,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {35088#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35089#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:08:27,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {35089#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35090#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:08:27,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {35090#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35091#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:08:27,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {35091#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35092#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:08:27,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {35092#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35093#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:08:27,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {35093#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35094#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:08:27,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {35094#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35095#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:08:27,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {35095#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35096#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:08:27,014 INFO L290 TraceCheckUtils]: 59: Hoare triple {35096#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35097#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:08:27,014 INFO L290 TraceCheckUtils]: 60: Hoare triple {35097#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35098#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} is VALID [2022-04-15 06:08:27,015 INFO L290 TraceCheckUtils]: 61: Hoare triple {35098#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35099#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} is VALID [2022-04-15 06:08:27,015 INFO L290 TraceCheckUtils]: 62: Hoare triple {35099#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35291#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} is VALID [2022-04-15 06:08:27,016 INFO L290 TraceCheckUtils]: 63: Hoare triple {35291#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {35039#false} is VALID [2022-04-15 06:08:27,016 INFO L272 TraceCheckUtils]: 64: Hoare triple {35039#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {35039#false} is VALID [2022-04-15 06:08:27,016 INFO L290 TraceCheckUtils]: 65: Hoare triple {35039#false} ~cond := #in~cond; {35039#false} is VALID [2022-04-15 06:08:27,016 INFO L290 TraceCheckUtils]: 66: Hoare triple {35039#false} assume 0 == ~cond; {35039#false} is VALID [2022-04-15 06:08:27,016 INFO L290 TraceCheckUtils]: 67: Hoare triple {35039#false} assume !false; {35039#false} is VALID [2022-04-15 06:08:27,016 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:08:27,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:08:33,458 INFO L290 TraceCheckUtils]: 67: Hoare triple {35039#false} assume !false; {35039#false} is VALID [2022-04-15 06:08:33,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {35310#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35039#false} is VALID [2022-04-15 06:08:33,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {35314#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35310#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:08:33,460 INFO L272 TraceCheckUtils]: 64: Hoare triple {35318#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {35314#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:08:33,460 INFO L290 TraceCheckUtils]: 63: Hoare triple {35322#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {35318#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:08:33,461 INFO L290 TraceCheckUtils]: 62: Hoare triple {35326#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35322#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {35330#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35326#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,465 INFO L290 TraceCheckUtils]: 60: Hoare triple {35334#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35330#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,466 INFO L290 TraceCheckUtils]: 59: Hoare triple {35338#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35334#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {35342#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35338#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {35346#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35342#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,468 INFO L290 TraceCheckUtils]: 56: Hoare triple {35350#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35346#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,469 INFO L290 TraceCheckUtils]: 55: Hoare triple {35354#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35350#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {35358#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35354#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {35362#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35358#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {35366#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35362#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,480 INFO L290 TraceCheckUtils]: 51: Hoare triple {35370#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35366#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {35374#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35370#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,484 INFO L290 TraceCheckUtils]: 49: Hoare triple {35378#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35374#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,484 INFO L290 TraceCheckUtils]: 48: Hoare triple {35382#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35378#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {35386#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35382#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {35390#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35386#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {35394#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35390#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {35398#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35394#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {35402#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35398#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {35406#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35402#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {35410#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35406#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {35414#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35410#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {35418#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35414#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {35422#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35418#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,496 INFO L290 TraceCheckUtils]: 37: Hoare triple {35426#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35422#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {35430#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35426#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {35434#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35430#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {35438#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35434#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {35442#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35438#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {35446#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35442#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {35450#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35446#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {35454#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35450#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {35458#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35454#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {35462#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35458#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {35466#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35462#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {35470#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35466#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {35474#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35470#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {35478#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35474#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {35482#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35478#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {35486#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35482#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {35490#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35486#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {35494#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35490#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {35498#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35494#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {35502#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35498#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {35506#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35502#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {35510#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35506#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {35514#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35510#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {35518#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35514#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {35522#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35518#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {35526#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35522#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {35530#(or (< 1 (mod (+ 4294967192 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35526#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {35534#(or (< 1 (mod (+ main_~x~0 4294967190) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35530#(or (< 1 (mod (+ 4294967192 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {35538#(or (< 1 (mod (+ 4294967188 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35534#(or (< 1 (mod (+ main_~x~0 4294967190) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {35542#(or (< 1 (mod (+ main_~x~0 4294967186) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35538#(or (< 1 (mod (+ 4294967188 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {35546#(or (< 1 (mod (+ main_~x~0 4294967184) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35542#(or (< 1 (mod (+ main_~x~0 4294967186) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {35550#(or (< 1 (mod (+ main_~x~0 4294967182) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {35546#(or (< 1 (mod (+ main_~x~0 4294967184) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {35038#true} ~x~0 := 268435441; {35550#(or (< 1 (mod (+ main_~x~0 4294967182) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:33,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {35038#true} call #t~ret4 := main(); {35038#true} is VALID [2022-04-15 06:08:33,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35038#true} {35038#true} #34#return; {35038#true} is VALID [2022-04-15 06:08:33,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {35038#true} assume true; {35038#true} is VALID [2022-04-15 06:08:33,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {35038#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35038#true} is VALID [2022-04-15 06:08:33,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {35038#true} call ULTIMATE.init(); {35038#true} is VALID [2022-04-15 06:08:33,538 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:08:33,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137183050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:08:33,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:08:33,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 63] total 123 [2022-04-15 06:08:33,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:08:33,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [896524095] [2022-04-15 06:08:33,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [896524095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:33,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:33,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-15 06:08:33,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278747108] [2022-04-15 06:08:33,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:08:33,539 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:08:33,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:08:33,539 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:08:33,576 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:08:33,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-15 06:08:33,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:33,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-15 06:08:33,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=11225, Unknown=0, NotChecked=0, Total=15006 [2022-04-15 06:08:33,578 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:08:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:40,216 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-15 06:08:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 06:08:40,217 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:08:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:40,217 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:08:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-04-15 06:08:40,218 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:08:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-04-15 06:08:40,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 75 transitions. [2022-04-15 06:08:40,262 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:08:40,263 INFO L225 Difference]: With dead ends: 75 [2022-04-15 06:08:40,263 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 06:08:40,264 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=7491, Invalid=25089, Unknown=0, NotChecked=0, Total=32580 [2022-04-15 06:08:40,264 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 3565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:08:40,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 3565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3448 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 06:08:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 06:08:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 06:08:40,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:40,335 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:08:40,335 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:08:40,335 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:08:40,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:40,336 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 06:08:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-15 06:08:40,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:40,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:40,336 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:08:40,336 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:08:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:40,337 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-15 06:08:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-15 06:08:40,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:40,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:40,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:40,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:40,337 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:08:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2022-04-15 06:08:40,338 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2022-04-15 06:08:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:40,338 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2022-04-15 06:08:40,338 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:08:40,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 70 transitions. [2022-04-15 06:08:40,391 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:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-15 06:08:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 06:08:40,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:40,392 INFO L499 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:40,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2022-04-15 06:08:40,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2022-04-15 06:08:40,793 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:08:40,793 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1525786084, now seen corresponding path program 115 times [2022-04-15 06:08:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:40,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [274570491] [2022-04-15 06:08:40,914 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:40,916 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:08:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1501696823, now seen corresponding path program 1 times [2022-04-15 06:08:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:40,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396491555] [2022-04-15 06:08:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:40,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:40,921 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_58.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:08:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:08:40,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21692994] [2022-04-15 06:08:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:40,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:40,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:40,924 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:08:40,925 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:08:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:08:40,963 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:08:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:08:40,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:08:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1525786084, now seen corresponding path program 116 times [2022-04-15 06:08:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:40,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757340078] [2022-04-15 06:08:40,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:40,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:42,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {36181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36117#true} is VALID [2022-04-15 06:08:42,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {36117#true} assume true; {36117#true} is VALID [2022-04-15 06:08:42,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36117#true} {36117#true} #34#return; {36117#true} is VALID [2022-04-15 06:08:42,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {36117#true} call ULTIMATE.init(); {36181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:08:42,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {36181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36117#true} is VALID [2022-04-15 06:08:42,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {36117#true} assume true; {36117#true} is VALID [2022-04-15 06:08:42,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36117#true} {36117#true} #34#return; {36117#true} is VALID [2022-04-15 06:08:42,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {36117#true} call #t~ret4 := main(); {36117#true} is VALID [2022-04-15 06:08:42,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {36117#true} ~x~0 := 268435441; {36122#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:08:42,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {36122#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36123#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:08:42,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {36123#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36124#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:08:42,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {36124#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36125#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:08:42,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {36125#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36126#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:08:42,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {36126#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36127#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:08:42,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {36127#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36128#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:08:42,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {36128#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36129#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:08:42,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {36129#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36130#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:08:42,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {36130#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36131#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:08:42,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {36131#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36132#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:08:42,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {36132#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36133#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:08:42,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {36133#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36134#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:08:42,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {36134#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36135#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:08:42,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {36135#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36136#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:08:42,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {36136#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36137#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:08:42,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {36137#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36138#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:08:42,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {36138#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36139#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:08:42,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {36139#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36140#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:08:42,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {36140#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36141#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:08:42,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {36141#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36142#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:08:42,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {36142#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36143#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:08:42,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {36143#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36144#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:08:42,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {36144#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36145#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:08:42,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {36145#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36146#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:08:42,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {36146#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36147#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:08:42,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {36147#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36148#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:08:42,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {36148#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36149#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:08:42,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {36149#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36150#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:08:42,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {36150#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36151#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:08:42,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {36151#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36152#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:08:42,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {36152#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36153#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:08:42,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {36153#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36154#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:08:42,605 INFO L290 TraceCheckUtils]: 38: Hoare triple {36154#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36155#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:08:42,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {36155#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36156#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:08:42,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {36156#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36157#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:08:42,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {36157#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36158#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:08:42,607 INFO L290 TraceCheckUtils]: 42: Hoare triple {36158#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36159#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:08:42,607 INFO L290 TraceCheckUtils]: 43: Hoare triple {36159#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36160#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:08:42,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {36160#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36161#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:08:42,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {36161#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36162#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:08:42,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {36162#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36163#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:08:42,609 INFO L290 TraceCheckUtils]: 47: Hoare triple {36163#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36164#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:08:42,609 INFO L290 TraceCheckUtils]: 48: Hoare triple {36164#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36165#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:08:42,610 INFO L290 TraceCheckUtils]: 49: Hoare triple {36165#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36166#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:08:42,610 INFO L290 TraceCheckUtils]: 50: Hoare triple {36166#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36167#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:08:42,611 INFO L290 TraceCheckUtils]: 51: Hoare triple {36167#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36168#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:08:42,611 INFO L290 TraceCheckUtils]: 52: Hoare triple {36168#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36169#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:08:42,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {36169#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36170#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:08:42,612 INFO L290 TraceCheckUtils]: 54: Hoare triple {36170#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36171#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:08:42,613 INFO L290 TraceCheckUtils]: 55: Hoare triple {36171#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36172#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:08:42,613 INFO L290 TraceCheckUtils]: 56: Hoare triple {36172#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36173#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:08:42,614 INFO L290 TraceCheckUtils]: 57: Hoare triple {36173#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36174#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:08:42,614 INFO L290 TraceCheckUtils]: 58: Hoare triple {36174#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36175#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:08:42,615 INFO L290 TraceCheckUtils]: 59: Hoare triple {36175#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36176#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:08:42,615 INFO L290 TraceCheckUtils]: 60: Hoare triple {36176#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36177#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} is VALID [2022-04-15 06:08:42,615 INFO L290 TraceCheckUtils]: 61: Hoare triple {36177#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36178#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} is VALID [2022-04-15 06:08:42,616 INFO L290 TraceCheckUtils]: 62: Hoare triple {36178#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36179#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} is VALID [2022-04-15 06:08:42,616 INFO L290 TraceCheckUtils]: 63: Hoare triple {36179#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36180#(and (<= 268435325 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:08:42,617 INFO L290 TraceCheckUtils]: 64: Hoare triple {36180#(and (<= 268435325 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {36118#false} is VALID [2022-04-15 06:08:42,617 INFO L272 TraceCheckUtils]: 65: Hoare triple {36118#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {36118#false} is VALID [2022-04-15 06:08:42,617 INFO L290 TraceCheckUtils]: 66: Hoare triple {36118#false} ~cond := #in~cond; {36118#false} is VALID [2022-04-15 06:08:42,617 INFO L290 TraceCheckUtils]: 67: Hoare triple {36118#false} assume 0 == ~cond; {36118#false} is VALID [2022-04-15 06:08:42,617 INFO L290 TraceCheckUtils]: 68: Hoare triple {36118#false} assume !false; {36118#false} is VALID [2022-04-15 06:08:42,618 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:42,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:42,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757340078] [2022-04-15 06:08:42,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757340078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:42,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449260388] [2022-04-15 06:08:42,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:08:42,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:42,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:42,619 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:08:42,619 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:08:42,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:08:42,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:08:42,676 WARN L261 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 122 conjunts are in the unsatisfiable core [2022-04-15 06:08:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:42,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:08:43,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {36117#true} call ULTIMATE.init(); {36117#true} is VALID [2022-04-15 06:08:43,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {36117#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36117#true} is VALID [2022-04-15 06:08:43,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {36117#true} assume true; {36117#true} is VALID [2022-04-15 06:08:43,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36117#true} {36117#true} #34#return; {36117#true} is VALID [2022-04-15 06:08:43,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {36117#true} call #t~ret4 := main(); {36117#true} is VALID [2022-04-15 06:08:43,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {36117#true} ~x~0 := 268435441; {36122#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:08:43,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {36122#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36123#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:08:43,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {36123#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36124#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:08:43,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {36124#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36125#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:08:43,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {36125#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36126#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:08:43,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {36126#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36127#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:08:43,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {36127#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36128#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:08:43,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {36128#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36129#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:08:43,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {36129#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36130#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:08:43,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {36130#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36131#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:08:43,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {36131#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36132#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:08:43,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {36132#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36133#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:08:43,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {36133#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36134#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:08:43,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {36134#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36135#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:08:43,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {36135#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36136#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:08:43,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {36136#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36137#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:08:43,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {36137#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36138#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:08:43,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {36138#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36139#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:08:43,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {36139#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36140#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:08:43,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {36140#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36141#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:08:43,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {36141#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36142#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:08:43,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {36142#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36143#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:08:43,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {36143#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36144#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:08:43,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {36144#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36145#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:08:43,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {36145#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36146#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:08:43,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {36146#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36147#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:08:43,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {36147#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36148#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:08:43,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {36148#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36149#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:08:43,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {36149#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36150#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:08:43,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {36150#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36151#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:08:43,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {36151#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36152#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:08:43,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {36152#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36153#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:08:43,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {36153#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36154#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:08:43,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {36154#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36155#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:08:43,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {36155#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36156#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:08:43,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {36156#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36157#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:08:43,241 INFO L290 TraceCheckUtils]: 41: Hoare triple {36157#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36158#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:08:43,241 INFO L290 TraceCheckUtils]: 42: Hoare triple {36158#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36159#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:08:43,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {36159#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36160#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:08:43,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {36160#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36161#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:08:43,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {36161#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36162#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:08:43,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {36162#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36163#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:08:43,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {36163#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36164#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:08:43,244 INFO L290 TraceCheckUtils]: 48: Hoare triple {36164#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36165#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:08:43,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {36165#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36166#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:08:43,245 INFO L290 TraceCheckUtils]: 50: Hoare triple {36166#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36167#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:08:43,245 INFO L290 TraceCheckUtils]: 51: Hoare triple {36167#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36168#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:08:43,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {36168#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36169#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:08:43,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {36169#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36170#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:08:43,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {36170#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36171#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:08:43,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {36171#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36172#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:08:43,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {36172#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36173#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:08:43,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {36173#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36174#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:08:43,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {36174#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36175#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:08:43,271 INFO L290 TraceCheckUtils]: 59: Hoare triple {36175#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36176#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:08:43,272 INFO L290 TraceCheckUtils]: 60: Hoare triple {36176#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36177#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} is VALID [2022-04-15 06:08:43,272 INFO L290 TraceCheckUtils]: 61: Hoare triple {36177#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36178#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} is VALID [2022-04-15 06:08:43,273 INFO L290 TraceCheckUtils]: 62: Hoare triple {36178#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36179#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} is VALID [2022-04-15 06:08:43,273 INFO L290 TraceCheckUtils]: 63: Hoare triple {36179#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36374#(and (<= 268435325 main_~x~0) (<= main_~x~0 268435325))} is VALID [2022-04-15 06:08:43,274 INFO L290 TraceCheckUtils]: 64: Hoare triple {36374#(and (<= 268435325 main_~x~0) (<= main_~x~0 268435325))} assume !(~x~0 % 4294967296 > 1); {36118#false} is VALID [2022-04-15 06:08:43,274 INFO L272 TraceCheckUtils]: 65: Hoare triple {36118#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {36118#false} is VALID [2022-04-15 06:08:43,274 INFO L290 TraceCheckUtils]: 66: Hoare triple {36118#false} ~cond := #in~cond; {36118#false} is VALID [2022-04-15 06:08:43,274 INFO L290 TraceCheckUtils]: 67: Hoare triple {36118#false} assume 0 == ~cond; {36118#false} is VALID [2022-04-15 06:08:43,274 INFO L290 TraceCheckUtils]: 68: Hoare triple {36118#false} assume !false; {36118#false} is VALID [2022-04-15 06:08:43,274 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:43,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:08:49,992 INFO L290 TraceCheckUtils]: 68: Hoare triple {36118#false} assume !false; {36118#false} is VALID [2022-04-15 06:08:49,993 INFO L290 TraceCheckUtils]: 67: Hoare triple {36393#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {36118#false} is VALID [2022-04-15 06:08:49,993 INFO L290 TraceCheckUtils]: 66: Hoare triple {36397#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36393#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:08:49,993 INFO L272 TraceCheckUtils]: 65: Hoare triple {36401#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {36397#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:08:49,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {36405#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 > 1); {36401#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 06:08:49,995 INFO L290 TraceCheckUtils]: 63: Hoare triple {36409#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36405#(or (< 1 (mod main_~x~0 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:49,997 INFO L290 TraceCheckUtils]: 62: Hoare triple {36413#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36409#(or (< 1 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:49,997 INFO L290 TraceCheckUtils]: 61: Hoare triple {36417#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36413#(or (< 1 (mod (+ 4294967292 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,000 INFO L290 TraceCheckUtils]: 60: Hoare triple {36421#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36417#(or (< 1 (mod (+ 4294967290 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,001 INFO L290 TraceCheckUtils]: 59: Hoare triple {36425#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36421#(or (< 1 (mod (+ 4294967288 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,005 INFO L290 TraceCheckUtils]: 58: Hoare triple {36429#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36425#(or (< 1 (mod (+ main_~x~0 4294967286) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {36433#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36429#(or (< 1 (mod (+ main_~x~0 4294967284) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {36437#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36433#(or (< 1 (mod (+ 4294967282 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {36441#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36437#(or (< 1 (mod (+ main_~x~0 4294967280) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {36445#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36441#(or (< 1 (mod (+ main_~x~0 4294967278) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,010 INFO L290 TraceCheckUtils]: 53: Hoare triple {36449#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36445#(or (< 1 (mod (+ 4294967276 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {36453#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36449#(or (< 1 (mod (+ 4294967274 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,012 INFO L290 TraceCheckUtils]: 51: Hoare triple {36457#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36453#(or (< 1 (mod (+ 4294967272 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {36461#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36457#(or (< 1 (mod (+ main_~x~0 4294967270) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {36465#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36461#(or (< 1 (mod (+ main_~x~0 4294967268) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {36469#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36465#(or (< 1 (mod (+ main_~x~0 4294967266) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {36473#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36469#(or (< 1 (mod (+ main_~x~0 4294967264) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {36477#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36473#(or (< 1 (mod (+ main_~x~0 4294967262) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {36481#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36477#(or (< 1 (mod (+ 4294967260 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {36485#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36481#(or (< 1 (mod (+ main_~x~0 4294967258) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {36489#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36485#(or (< 1 (mod (+ main_~x~0 4294967256) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {36493#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36489#(or (< 1 (mod (+ 4294967254 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {36497#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36493#(or (< 1 (mod (+ main_~x~0 4294967252) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {36501#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36497#(or (< 1 (mod (+ 4294967250 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {36505#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36501#(or (< 1 (mod (+ main_~x~0 4294967248) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {36509#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36505#(or (< 1 (mod (+ 4294967246 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {36513#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36509#(or (< 1 (mod (+ main_~x~0 4294967244) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {36517#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36513#(or (< 1 (mod (+ main_~x~0 4294967242) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {36521#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36517#(or (< 1 (mod (+ 4294967240 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {36525#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36521#(or (< 1 (mod (+ 4294967238 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {36529#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36525#(or (< 1 (mod (+ main_~x~0 4294967236) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {36533#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36529#(or (< 1 (mod (+ main_~x~0 4294967234) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {36537#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36533#(or (< 1 (mod (+ main_~x~0 4294967232) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {36541#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36537#(or (< 1 (mod (+ 4294967230 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {36545#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36541#(or (< 1 (mod (+ main_~x~0 4294967228) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {36549#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36545#(or (< 1 (mod (+ main_~x~0 4294967226) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {36553#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36549#(or (< 1 (mod (+ 4294967224 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {36557#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36553#(or (< 1 (mod (+ main_~x~0 4294967222) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {36561#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36557#(or (< 1 (mod (+ main_~x~0 4294967220) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {36565#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36561#(or (< 1 (mod (+ 4294967218 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {36569#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36565#(or (< 1 (mod (+ 4294967216 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {36573#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36569#(or (< 1 (mod (+ main_~x~0 4294967214) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {36577#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36573#(or (< 1 (mod (+ 4294967212 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {36581#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36577#(or (< 1 (mod (+ 4294967210 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {36585#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36581#(or (< 1 (mod (+ main_~x~0 4294967208) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {36589#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36585#(or (< 1 (mod (+ 4294967206 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {36593#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36589#(or (< 1 (mod (+ main_~x~0 4294967204) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {36597#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36593#(or (< 1 (mod (+ 4294967202 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {36601#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36597#(or (< 1 (mod (+ 4294967200 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {36605#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36601#(or (< 1 (mod (+ 4294967198 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {36609#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36605#(or (< 1 (mod (+ 4294967196 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {36613#(or (< 1 (mod (+ 4294967192 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36609#(or (< 1 (mod (+ 4294967194 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {36617#(or (< 1 (mod (+ main_~x~0 4294967190) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36613#(or (< 1 (mod (+ 4294967192 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {36621#(or (< 1 (mod (+ 4294967188 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36617#(or (< 1 (mod (+ main_~x~0 4294967190) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {36625#(or (< 1 (mod (+ main_~x~0 4294967186) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36621#(or (< 1 (mod (+ 4294967188 main_~x~0) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {36629#(or (< 1 (mod (+ main_~x~0 4294967184) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36625#(or (< 1 (mod (+ main_~x~0 4294967186) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {36633#(or (< 1 (mod (+ main_~x~0 4294967182) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36629#(or (< 1 (mod (+ main_~x~0 4294967184) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {36637#(or (< 1 (mod (+ main_~x~0 4294967180) 4294967296)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {36633#(or (< 1 (mod (+ main_~x~0 4294967182) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {36117#true} ~x~0 := 268435441; {36637#(or (< 1 (mod (+ main_~x~0 4294967180) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 06:08:50,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {36117#true} call #t~ret4 := main(); {36117#true} is VALID [2022-04-15 06:08:50,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36117#true} {36117#true} #34#return; {36117#true} is VALID [2022-04-15 06:08:50,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {36117#true} assume true; {36117#true} is VALID [2022-04-15 06:08:50,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {36117#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36117#true} is VALID [2022-04-15 06:08:50,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {36117#true} call ULTIMATE.init(); {36117#true} is VALID [2022-04-15 06:08:50,069 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:50,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449260388] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:08:50,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:08:50,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 64] total 125 [2022-04-15 06:08:50,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:08:50,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [274570491] [2022-04-15 06:08:50,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [274570491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:08:50,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:08:50,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 06:08:50,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474541968] [2022-04-15 06:08:50,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:08:50,070 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:50,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:08:50,070 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:50,105 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:50,105 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 06:08:50,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:50,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 06:08:50,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3905, Invalid=11595, Unknown=0, NotChecked=0, Total=15500 [2022-04-15 06:08:50,107 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:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:57,226 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-15 06:08:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 06:08:57,226 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:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:08:57,226 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:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-15 06:08:57,227 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:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-15 06:08:57,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 76 transitions. [2022-04-15 06:08:57,271 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:57,271 INFO L225 Difference]: With dead ends: 76 [2022-04-15 06:08:57,271 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 06:08:57,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=7738, Invalid=25934, Unknown=0, NotChecked=0, Total=33672 [2022-04-15 06:08:57,273 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 3674 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 3793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:08:57,273 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 263 Invalid, 3793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3674 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 06:08:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 06:08:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 06:08:57,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:08:57,360 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:57,360 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:57,360 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:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:57,361 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-15 06:08:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-15 06:08:57,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:57,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:57,362 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:57,362 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:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:08:57,362 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-15 06:08:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-15 06:08:57,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:08:57,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:08:57,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:08:57,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:08:57,363 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:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-15 06:08:57,363 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2022-04-15 06:08:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:08:57,363 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-15 06:08:57,364 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:57,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-15 06:08:57,411 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:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-15 06:08:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 06:08:57,412 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:08:57,412 INFO L499 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:08:57,417 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:57,628 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:57,812 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:57,812 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:08:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:08:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash -18267082, now seen corresponding path program 117 times [2022-04-15 06:08:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:08:57,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1080433094] [2022-04-15 06:08:57,936 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:57,937 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:08:57,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1560802167, now seen corresponding path program 1 times [2022-04-15 06:08:57,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:57,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054478615] [2022-04-15 06:08:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:57,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:57,943 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_59.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:08:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:08:57,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799825362] [2022-04-15 06:08:57,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:57,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:57,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:57,946 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:57,946 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:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:08:57,987 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:08:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:08:57,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:08:57,994 INFO L85 PathProgramCache]: Analyzing trace with hash -18267082, now seen corresponding path program 118 times [2022-04-15 06:08:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:08:57,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645480859] [2022-04-15 06:08:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:08:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:08:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:59,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:59,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {37277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37212#true} is VALID [2022-04-15 06:08:59,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {37212#true} assume true; {37212#true} is VALID [2022-04-15 06:08:59,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37212#true} {37212#true} #34#return; {37212#true} is VALID [2022-04-15 06:08:59,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {37212#true} call ULTIMATE.init(); {37277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:08:59,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {37277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37212#true} is VALID [2022-04-15 06:08:59,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {37212#true} assume true; {37212#true} is VALID [2022-04-15 06:08:59,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37212#true} {37212#true} #34#return; {37212#true} is VALID [2022-04-15 06:08:59,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {37212#true} call #t~ret4 := main(); {37212#true} is VALID [2022-04-15 06:08:59,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {37212#true} ~x~0 := 268435441; {37217#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:08:59,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {37217#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37218#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:08:59,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {37218#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37219#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:08:59,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {37219#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37220#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:08:59,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {37220#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37221#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:08:59,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {37221#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37222#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:08:59,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {37222#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37223#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:08:59,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {37223#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37224#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:08:59,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {37224#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37225#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:08:59,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {37225#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37226#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:08:59,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {37226#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37227#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:08:59,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {37227#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37228#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:08:59,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {37228#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37229#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:08:59,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {37229#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37230#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:08:59,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {37230#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37231#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:08:59,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {37231#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37232#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:08:59,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {37232#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37233#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:08:59,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {37233#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37234#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:08:59,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {37234#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37235#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:08:59,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {37235#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37236#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:08:59,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {37236#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37237#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:08:59,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {37237#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37238#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:08:59,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {37238#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37239#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:08:59,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {37239#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37240#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:08:59,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {37240#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37241#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:08:59,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {37241#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37242#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:08:59,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {37242#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37243#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:08:59,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {37243#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37244#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:08:59,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {37244#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37245#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:08:59,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {37245#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37246#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:08:59,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {37246#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37247#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:08:59,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {37247#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37248#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:08:59,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {37248#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37249#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:08:59,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {37249#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37250#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:08:59,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {37250#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37251#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:08:59,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {37251#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37252#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:08:59,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {37252#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37253#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:08:59,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {37253#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37254#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:08:59,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {37254#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37255#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:08:59,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {37255#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37256#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:08:59,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {37256#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37257#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:08:59,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {37257#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37258#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:08:59,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {37258#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37259#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:08:59,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {37259#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37260#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:08:59,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {37260#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37261#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:08:59,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {37261#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37262#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:08:59,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {37262#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37263#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:08:59,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {37263#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37264#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:08:59,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {37264#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37265#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:08:59,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {37265#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37266#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:08:59,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {37266#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37267#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:08:59,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {37267#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37268#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:08:59,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {37268#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37269#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:08:59,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {37269#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37270#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:08:59,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {37270#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37271#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:08:59,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {37271#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37272#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} is VALID [2022-04-15 06:08:59,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {37272#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37273#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} is VALID [2022-04-15 06:08:59,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {37273#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37274#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} is VALID [2022-04-15 06:08:59,771 INFO L290 TraceCheckUtils]: 63: Hoare triple {37274#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37275#(and (<= 268435325 main_~x~0) (<= main_~x~0 268435325))} is VALID [2022-04-15 06:08:59,772 INFO L290 TraceCheckUtils]: 64: Hoare triple {37275#(and (<= 268435325 main_~x~0) (<= main_~x~0 268435325))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37276#(and (<= 268435323 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:08:59,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {37276#(and (<= 268435323 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {37213#false} is VALID [2022-04-15 06:08:59,773 INFO L272 TraceCheckUtils]: 66: Hoare triple {37213#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {37213#false} is VALID [2022-04-15 06:08:59,773 INFO L290 TraceCheckUtils]: 67: Hoare triple {37213#false} ~cond := #in~cond; {37213#false} is VALID [2022-04-15 06:08:59,773 INFO L290 TraceCheckUtils]: 68: Hoare triple {37213#false} assume 0 == ~cond; {37213#false} is VALID [2022-04-15 06:08:59,773 INFO L290 TraceCheckUtils]: 69: Hoare triple {37213#false} assume !false; {37213#false} is VALID [2022-04-15 06:08:59,773 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:59,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:59,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645480859] [2022-04-15 06:08:59,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645480859] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:59,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151480643] [2022-04-15 06:08:59,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:08:59,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:59,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:59,774 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:59,775 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:59,925 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:08:59,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:08:59,928 WARN L261 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 121 conjunts are in the unsatisfiable core [2022-04-15 06:08:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:59,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:09:00,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {37212#true} call ULTIMATE.init(); {37212#true} is VALID [2022-04-15 06:09:00,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {37212#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37212#true} is VALID [2022-04-15 06:09:00,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {37212#true} assume true; {37212#true} is VALID [2022-04-15 06:09:00,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37212#true} {37212#true} #34#return; {37212#true} is VALID [2022-04-15 06:09:00,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {37212#true} call #t~ret4 := main(); {37212#true} is VALID [2022-04-15 06:09:00,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {37212#true} ~x~0 := 268435441; {37217#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:09:00,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {37217#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37218#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:09:00,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {37218#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37219#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:09:00,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {37219#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37220#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:09:00,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {37220#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37221#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:09:00,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {37221#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37222#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:09:00,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {37222#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37223#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:09:00,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {37223#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37224#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:09:00,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {37224#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37225#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:09:00,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {37225#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37226#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:09:00,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {37226#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37227#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:09:00,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {37227#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37228#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:09:00,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {37228#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37229#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:09:00,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {37229#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37230#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:09:00,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {37230#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37231#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:09:00,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {37231#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37232#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:09:00,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {37232#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37233#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:09:00,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {37233#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37234#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:09:00,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {37234#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37235#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:09:00,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {37235#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37236#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:09:00,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {37236#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37237#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:09:00,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {37237#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37238#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:09:00,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {37238#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37239#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:09:00,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {37239#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37240#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:09:00,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {37240#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37241#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:09:00,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {37241#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37242#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:09:00,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {37242#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37243#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:09:00,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {37243#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37244#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:09:00,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {37244#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37245#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:09:00,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {37245#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37246#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:09:00,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {37246#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37247#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:09:00,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {37247#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37248#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:09:00,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {37248#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37249#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:09:00,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {37249#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37250#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:09:00,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {37250#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37251#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:09:00,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {37251#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37252#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:09:00,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {37252#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37253#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:09:00,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {37253#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37254#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:09:00,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {37254#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37255#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:09:00,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {37255#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37256#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:09:00,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {37256#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37257#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:09:00,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {37257#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37258#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:09:00,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {37258#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37259#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:09:00,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {37259#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37260#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:09:00,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {37260#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37261#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:09:00,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {37261#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37262#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:09:00,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {37262#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37263#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:09:00,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {37263#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37264#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:09:00,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {37264#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37265#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:09:00,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {37265#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37266#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:09:00,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {37266#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37267#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:09:00,642 INFO L290 TraceCheckUtils]: 56: Hoare triple {37267#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37268#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:09:00,643 INFO L290 TraceCheckUtils]: 57: Hoare triple {37268#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37269#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:09:00,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {37269#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37270#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:09:00,644 INFO L290 TraceCheckUtils]: 59: Hoare triple {37270#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37271#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:09:00,644 INFO L290 TraceCheckUtils]: 60: Hoare triple {37271#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37272#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} is VALID [2022-04-15 06:09:00,645 INFO L290 TraceCheckUtils]: 61: Hoare triple {37272#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37273#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} is VALID [2022-04-15 06:09:00,645 INFO L290 TraceCheckUtils]: 62: Hoare triple {37273#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37274#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} is VALID [2022-04-15 06:09:00,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {37274#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37275#(and (<= 268435325 main_~x~0) (<= main_~x~0 268435325))} is VALID [2022-04-15 06:09:00,646 INFO L290 TraceCheckUtils]: 64: Hoare triple {37275#(and (<= 268435325 main_~x~0) (<= main_~x~0 268435325))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37473#(and (<= main_~x~0 268435323) (<= 268435323 main_~x~0))} is VALID [2022-04-15 06:09:00,647 INFO L290 TraceCheckUtils]: 65: Hoare triple {37473#(and (<= main_~x~0 268435323) (<= 268435323 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {37213#false} is VALID [2022-04-15 06:09:00,647 INFO L272 TraceCheckUtils]: 66: Hoare triple {37213#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {37213#false} is VALID [2022-04-15 06:09:00,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {37213#false} ~cond := #in~cond; {37213#false} is VALID [2022-04-15 06:09:00,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {37213#false} assume 0 == ~cond; {37213#false} is VALID [2022-04-15 06:09:00,647 INFO L290 TraceCheckUtils]: 69: Hoare triple {37213#false} assume !false; {37213#false} is VALID [2022-04-15 06:09:00,647 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:09:00,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:09:06,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {37213#false} assume !false; {37213#false} is VALID [2022-04-15 06:09:06,061 INFO L290 TraceCheckUtils]: 68: Hoare triple {37213#false} assume 0 == ~cond; {37213#false} is VALID [2022-04-15 06:09:06,061 INFO L290 TraceCheckUtils]: 67: Hoare triple {37213#false} ~cond := #in~cond; {37213#false} is VALID [2022-04-15 06:09:06,061 INFO L272 TraceCheckUtils]: 66: Hoare triple {37213#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {37213#false} is VALID [2022-04-15 06:09:06,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {37501#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {37213#false} is VALID [2022-04-15 06:09:06,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {37505#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37501#(< 1 (mod main_~x~0 4294967296))} is VALID [2022-04-15 06:09:06,064 INFO L290 TraceCheckUtils]: 63: Hoare triple {37509#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37505#(< 1 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 06:09:06,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {37513#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37509#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {37517#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37513#(< 1 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {37521#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37517#(< 1 (mod (+ 4294967288 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {37525#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37521#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-15 06:09:06,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {37529#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37525#(< 1 (mod (+ main_~x~0 4294967284) 4294967296))} is VALID [2022-04-15 06:09:06,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {37533#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37529#(< 1 (mod (+ 4294967282 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {37537#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37533#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-15 06:09:06,070 INFO L290 TraceCheckUtils]: 55: Hoare triple {37541#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37537#(< 1 (mod (+ main_~x~0 4294967278) 4294967296))} is VALID [2022-04-15 06:09:06,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {37545#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37541#(< 1 (mod (+ 4294967276 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {37549#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37545#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {37553#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37549#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {37557#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37553#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-15 06:09:06,073 INFO L290 TraceCheckUtils]: 50: Hoare triple {37561#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37557#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-15 06:09:06,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {37565#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37561#(< 1 (mod (+ main_~x~0 4294967266) 4294967296))} is VALID [2022-04-15 06:09:06,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {37569#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37565#(< 1 (mod (+ main_~x~0 4294967264) 4294967296))} is VALID [2022-04-15 06:09:06,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {37573#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37569#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-15 06:09:06,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {37577#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37573#(< 1 (mod (+ 4294967260 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {37581#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37577#(< 1 (mod (+ main_~x~0 4294967258) 4294967296))} is VALID [2022-04-15 06:09:06,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {37585#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37581#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-15 06:09:06,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {37589#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37585#(< 1 (mod (+ 4294967254 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {37593#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37589#(< 1 (mod (+ main_~x~0 4294967252) 4294967296))} is VALID [2022-04-15 06:09:06,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {37597#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37593#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {37601#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37597#(< 1 (mod (+ main_~x~0 4294967248) 4294967296))} is VALID [2022-04-15 06:09:06,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {37605#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37601#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {37609#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37605#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-15 06:09:06,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {37613#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37609#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-15 06:09:06,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {37617#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37613#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {37621#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37617#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {37625#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37621#(< 1 (mod (+ main_~x~0 4294967236) 4294967296))} is VALID [2022-04-15 06:09:06,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {37629#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37625#(< 1 (mod (+ main_~x~0 4294967234) 4294967296))} is VALID [2022-04-15 06:09:06,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {37633#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37629#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-15 06:09:06,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {37637#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37633#(< 1 (mod (+ 4294967230 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {37641#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37637#(< 1 (mod (+ main_~x~0 4294967228) 4294967296))} is VALID [2022-04-15 06:09:06,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {37645#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37641#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-15 06:09:06,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {37649#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37645#(< 1 (mod (+ 4294967224 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {37653#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37649#(< 1 (mod (+ main_~x~0 4294967222) 4294967296))} is VALID [2022-04-15 06:09:06,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {37657#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37653#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-15 06:09:06,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {37661#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37657#(< 1 (mod (+ 4294967218 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {37665#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37661#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {37669#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37665#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} is VALID [2022-04-15 06:09:06,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {37673#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37669#(< 1 (mod (+ 4294967212 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {37677#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37673#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {37681#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37677#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} is VALID [2022-04-15 06:09:06,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {37685#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37681#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {37689#(< 1 (mod (+ 4294967202 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37685#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} is VALID [2022-04-15 06:09:06,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {37693#(< 1 (mod (+ 4294967200 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37689#(< 1 (mod (+ 4294967202 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {37697#(< 1 (mod (+ 4294967198 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37693#(< 1 (mod (+ 4294967200 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {37701#(< 1 (mod (+ 4294967196 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37697#(< 1 (mod (+ 4294967198 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {37705#(< 1 (mod (+ 4294967194 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37701#(< 1 (mod (+ 4294967196 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {37709#(< 1 (mod (+ 4294967192 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37705#(< 1 (mod (+ 4294967194 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {37713#(< 1 (mod (+ main_~x~0 4294967190) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37709#(< 1 (mod (+ 4294967192 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {37717#(< 1 (mod (+ 4294967188 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37713#(< 1 (mod (+ main_~x~0 4294967190) 4294967296))} is VALID [2022-04-15 06:09:06,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {37721#(< 1 (mod (+ main_~x~0 4294967186) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37717#(< 1 (mod (+ 4294967188 main_~x~0) 4294967296))} is VALID [2022-04-15 06:09:06,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {37725#(< 1 (mod (+ main_~x~0 4294967184) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37721#(< 1 (mod (+ main_~x~0 4294967186) 4294967296))} is VALID [2022-04-15 06:09:06,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {37729#(< 1 (mod (+ main_~x~0 4294967182) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37725#(< 1 (mod (+ main_~x~0 4294967184) 4294967296))} is VALID [2022-04-15 06:09:06,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {37733#(< 1 (mod (+ main_~x~0 4294967180) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37729#(< 1 (mod (+ main_~x~0 4294967182) 4294967296))} is VALID [2022-04-15 06:09:06,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {37737#(< 1 (mod (+ main_~x~0 4294967178) 4294967296))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {37733#(< 1 (mod (+ main_~x~0 4294967180) 4294967296))} is VALID [2022-04-15 06:09:06,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {37212#true} ~x~0 := 268435441; {37737#(< 1 (mod (+ main_~x~0 4294967178) 4294967296))} is VALID [2022-04-15 06:09:06,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {37212#true} call #t~ret4 := main(); {37212#true} is VALID [2022-04-15 06:09:06,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37212#true} {37212#true} #34#return; {37212#true} is VALID [2022-04-15 06:09:06,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {37212#true} assume true; {37212#true} is VALID [2022-04-15 06:09:06,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {37212#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37212#true} is VALID [2022-04-15 06:09:06,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {37212#true} call ULTIMATE.init(); {37212#true} is VALID [2022-04-15 06:09:06,105 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:09:06,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151480643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:09:06,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:09:06,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 124 [2022-04-15 06:09:06,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:09:06,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1080433094] [2022-04-15 06:09:06,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1080433094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:09:06,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:09:06,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 06:09:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510839863] [2022-04-15 06:09:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:09:06,107 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:09:06,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:09:06,107 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:09:06,152 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:09:06,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 06:09:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:06,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 06:09:06,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3965, Invalid=11287, Unknown=0, NotChecked=0, Total=15252 [2022-04-15 06:09:06,154 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:09:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:12,750 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-15 06:09:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 06:09:12,750 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:09:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:09:12,750 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:09:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-15 06:09:12,751 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:09:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-15 06:09:12,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 77 transitions. [2022-04-15 06:09:12,811 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:09:12,812 INFO L225 Difference]: With dead ends: 77 [2022-04-15 06:09:12,812 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 06:09:12,814 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1893 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=7923, Invalid=25749, Unknown=0, NotChecked=0, Total=33672 [2022-04-15 06:09:12,814 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 3597 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:09:12,814 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 3718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3597 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 06:09:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 06:09:12,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-04-15 06:09:12,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:09:12,889 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:09:12,890 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:09:12,890 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:09:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:12,890 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 06:09:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-15 06:09:12,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:12,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:12,891 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:09:12,891 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:09:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:09:12,891 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-15 06:09:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-15 06:09:12,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:09:12,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:09:12,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:09:12,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:09:12,892 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:09:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2022-04-15 06:09:12,892 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2022-04-15 06:09:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:09:12,892 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2022-04-15 06:09:12,892 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:09:12,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 72 transitions. [2022-04-15 06:09:12,956 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:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-15 06:09:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 06:09:12,956 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:09:12,956 INFO L499 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:09:12,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Forceful destruction successful, exit code 0 [2022-04-15 06:09:13,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2022-04-15 06:09:13,357 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:09:13,357 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:09:13,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:09:13,357 INFO L85 PathProgramCache]: Analyzing trace with hash -529818276, now seen corresponding path program 119 times [2022-04-15 06:09:13,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:09:13,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1629614708] [2022-04-15 06:09:13,468 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:13,470 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:09:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1619907511, now seen corresponding path program 1 times [2022-04-15 06:09:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:13,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080600072] [2022-04-15 06:09:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:13,475 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967294 .v_it_60.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)) (- 1))) 0)) [2022-04-15 06:09:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 06:09:13,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846545564] [2022-04-15 06:09:13,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:13,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:09:13,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:09:13,479 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:09:13,480 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:09:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:09:13,516 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:09:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:09:13,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:09:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash -529818276, now seen corresponding path program 120 times [2022-04-15 06:09:13,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:09:13,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373658195] [2022-04-15 06:09:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:09:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:09:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:09:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:09:15,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {38386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {38320#true} is VALID [2022-04-15 06:09:15,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {38320#true} assume true; {38320#true} is VALID [2022-04-15 06:09:15,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38320#true} {38320#true} #34#return; {38320#true} is VALID [2022-04-15 06:09:15,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {38320#true} call ULTIMATE.init(); {38386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:09:15,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {38386#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {38320#true} is VALID [2022-04-15 06:09:15,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {38320#true} assume true; {38320#true} is VALID [2022-04-15 06:09:15,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38320#true} {38320#true} #34#return; {38320#true} is VALID [2022-04-15 06:09:15,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {38320#true} call #t~ret4 := main(); {38320#true} is VALID [2022-04-15 06:09:15,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {38320#true} ~x~0 := 268435441; {38325#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} is VALID [2022-04-15 06:09:15,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {38325#(and (<= 268435441 main_~x~0) (<= main_~x~0 268435441))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38326#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2022-04-15 06:09:15,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {38326#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38327#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2022-04-15 06:09:15,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {38327#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38328#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2022-04-15 06:09:15,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {38328#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38329#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} is VALID [2022-04-15 06:09:15,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {38329#(and (<= main_~x~0 268435433) (<= 268435433 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38330#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2022-04-15 06:09:15,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {38330#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38331#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} is VALID [2022-04-15 06:09:15,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {38331#(and (<= main_~x~0 268435429) (<= 268435429 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38332#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} is VALID [2022-04-15 06:09:15,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {38332#(and (<= 268435427 main_~x~0) (<= main_~x~0 268435427))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38333#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} is VALID [2022-04-15 06:09:15,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {38333#(and (<= 268435425 main_~x~0) (<= main_~x~0 268435425))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38334#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} is VALID [2022-04-15 06:09:15,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {38334#(and (<= main_~x~0 268435423) (<= 268435423 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38335#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2022-04-15 06:09:15,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {38335#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38336#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2022-04-15 06:09:15,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {38336#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38337#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} is VALID [2022-04-15 06:09:15,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {38337#(and (<= main_~x~0 268435417) (<= 268435417 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38338#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} is VALID [2022-04-15 06:09:15,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {38338#(and (<= 268435415 main_~x~0) (<= main_~x~0 268435415))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38339#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2022-04-15 06:09:15,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {38339#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38340#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2022-04-15 06:09:15,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {38340#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38341#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} is VALID [2022-04-15 06:09:15,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {38341#(and (<= 268435409 main_~x~0) (<= main_~x~0 268435409))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38342#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2022-04-15 06:09:15,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {38342#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38343#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} is VALID [2022-04-15 06:09:15,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {38343#(and (<= main_~x~0 268435405) (<= 268435405 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38344#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2022-04-15 06:09:15,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {38344#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38345#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} is VALID [2022-04-15 06:09:15,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {38345#(and (<= main_~x~0 268435401) (<= 268435401 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38346#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} is VALID [2022-04-15 06:09:15,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {38346#(and (<= 268435399 main_~x~0) (<= main_~x~0 268435399))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38347#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} is VALID [2022-04-15 06:09:15,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {38347#(and (<= main_~x~0 268435397) (<= 268435397 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38348#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} is VALID [2022-04-15 06:09:15,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {38348#(and (<= 268435395 main_~x~0) (<= main_~x~0 268435395))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38349#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} is VALID [2022-04-15 06:09:15,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {38349#(and (<= 268435393 main_~x~0) (<= main_~x~0 268435393))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38350#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} is VALID [2022-04-15 06:09:15,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {38350#(and (<= 268435391 main_~x~0) (<= main_~x~0 268435391))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38351#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} is VALID [2022-04-15 06:09:15,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {38351#(and (<= main_~x~0 268435389) (<= 268435389 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38352#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} is VALID [2022-04-15 06:09:15,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {38352#(and (<= main_~x~0 268435387) (<= 268435387 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38353#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} is VALID [2022-04-15 06:09:15,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {38353#(and (<= 268435385 main_~x~0) (<= main_~x~0 268435385))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38354#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} is VALID [2022-04-15 06:09:15,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {38354#(and (<= 268435383 main_~x~0) (<= main_~x~0 268435383))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38355#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} is VALID [2022-04-15 06:09:15,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {38355#(and (<= main_~x~0 268435381) (<= 268435381 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38356#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} is VALID [2022-04-15 06:09:15,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {38356#(and (<= 268435379 main_~x~0) (<= main_~x~0 268435379))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38357#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} is VALID [2022-04-15 06:09:15,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {38357#(and (<= 268435377 main_~x~0) (<= main_~x~0 268435377))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38358#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} is VALID [2022-04-15 06:09:15,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {38358#(and (<= main_~x~0 268435375) (<= 268435375 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38359#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} is VALID [2022-04-15 06:09:15,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {38359#(and (<= main_~x~0 268435373) (<= 268435373 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38360#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} is VALID [2022-04-15 06:09:15,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {38360#(and (<= 268435371 main_~x~0) (<= main_~x~0 268435371))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38361#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} is VALID [2022-04-15 06:09:15,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {38361#(and (<= main_~x~0 268435369) (<= 268435369 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38362#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} is VALID [2022-04-15 06:09:15,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {38362#(and (<= main_~x~0 268435367) (<= 268435367 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38363#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} is VALID [2022-04-15 06:09:15,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {38363#(and (<= 268435365 main_~x~0) (<= main_~x~0 268435365))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38364#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} is VALID [2022-04-15 06:09:15,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {38364#(and (<= 268435363 main_~x~0) (<= main_~x~0 268435363))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38365#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} is VALID [2022-04-15 06:09:15,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {38365#(and (<= main_~x~0 268435361) (<= 268435361 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38366#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} is VALID [2022-04-15 06:09:15,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {38366#(and (<= main_~x~0 268435359) (<= 268435359 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38367#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} is VALID [2022-04-15 06:09:15,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {38367#(and (<= main_~x~0 268435357) (<= 268435357 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38368#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} is VALID [2022-04-15 06:09:15,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {38368#(and (<= main_~x~0 268435355) (<= 268435355 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38369#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} is VALID [2022-04-15 06:09:15,217 INFO L290 TraceCheckUtils]: 50: Hoare triple {38369#(and (<= main_~x~0 268435353) (<= 268435353 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38370#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} is VALID [2022-04-15 06:09:15,217 INFO L290 TraceCheckUtils]: 51: Hoare triple {38370#(and (<= 268435351 main_~x~0) (<= main_~x~0 268435351))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38371#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} is VALID [2022-04-15 06:09:15,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {38371#(and (<= 268435349 main_~x~0) (<= main_~x~0 268435349))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38372#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} is VALID [2022-04-15 06:09:15,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {38372#(and (<= 268435347 main_~x~0) (<= main_~x~0 268435347))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38373#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} is VALID [2022-04-15 06:09:15,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {38373#(and (<= main_~x~0 268435345) (<= 268435345 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38374#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} is VALID [2022-04-15 06:09:15,219 INFO L290 TraceCheckUtils]: 55: Hoare triple {38374#(and (<= main_~x~0 268435343) (<= 268435343 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38375#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} is VALID [2022-04-15 06:09:15,219 INFO L290 TraceCheckUtils]: 56: Hoare triple {38375#(and (<= 268435341 main_~x~0) (<= main_~x~0 268435341))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38376#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} is VALID [2022-04-15 06:09:15,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {38376#(and (<= 268435339 main_~x~0) (<= main_~x~0 268435339))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38377#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} is VALID [2022-04-15 06:09:15,220 INFO L290 TraceCheckUtils]: 58: Hoare triple {38377#(and (<= main_~x~0 268435337) (<= 268435337 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38378#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} is VALID [2022-04-15 06:09:15,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {38378#(and (<= main_~x~0 268435335) (<= 268435335 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38379#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} is VALID [2022-04-15 06:09:15,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {38379#(and (<= 268435333 main_~x~0) (<= main_~x~0 268435333))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38380#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} is VALID [2022-04-15 06:09:15,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {38380#(and (<= 268435331 main_~x~0) (<= main_~x~0 268435331))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38381#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} is VALID [2022-04-15 06:09:15,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {38381#(and (<= main_~x~0 268435329) (<= 268435329 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38382#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} is VALID [2022-04-15 06:09:15,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {38382#(and (<= main_~x~0 268435327) (<= 268435327 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38383#(and (<= 268435325 main_~x~0) (<= main_~x~0 268435325))} is VALID [2022-04-15 06:09:15,223 INFO L290 TraceCheckUtils]: 64: Hoare triple {38383#(and (<= 268435325 main_~x~0) (<= main_~x~0 268435325))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38384#(and (<= main_~x~0 268435323) (<= 268435323 main_~x~0))} is VALID [2022-04-15 06:09:15,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {38384#(and (<= main_~x~0 268435323) (<= 268435323 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {38385#(and (<= 268435321 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2022-04-15 06:09:15,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {38385#(and (<= 268435321 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {38321#false} is VALID [2022-04-15 06:09:15,224 INFO L272 TraceCheckUtils]: 67: Hoare triple {38321#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {38321#false} is VALID [2022-04-15 06:09:15,224 INFO L290 TraceCheckUtils]: 68: Hoare triple {38321#false} ~cond := #in~cond; {38321#false} is VALID [2022-04-15 06:09:15,224 INFO L290 TraceCheckUtils]: 69: Hoare triple {38321#false} assume 0 == ~cond; {38321#false} is VALID [2022-04-15 06:09:15,224 INFO L290 TraceCheckUtils]: 70: Hoare triple {38321#false} assume !false; {38321#false} is VALID [2022-04-15 06:09:15,225 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,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:09:15,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373658195] [2022-04-15 06:09:15,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373658195] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:09:15,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652183184] [2022-04-15 06:09:15,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:09:15,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:09:15,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:09:15,226 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:09:15,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process